遇见数据集

Comparison of tractability and hardness results for Fire and Cost-Fire for graphs on n vertices and m edges, maximum path length and budget b. Pathcontainable is defined in Sect 4.4.

收藏
Figshare2026-02-06 更新2026-04-28 收录
官方服务:

资源简介:

Comparison of tractability and hardness results for Fire and Cost-Fire for graphs on n vertices and m edges, maximum path length and budget b. Pathcontainable is defined in Sect 4.4.

创建时间:
2026-02-06
二维码
社区交流群
二维码
科研交流群
商业服务