遇见数据集

Benchmark Sets and Experimental Results for "A Direct k-Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric"

收藏
Zenodo2025-05-09 更新2026-05-26 收录
官方服务:

资源简介:

set_steinertrees.zip: the hypergraph benchmark set used in the experiments. HMetis format set_hierarchical_process_mapping.zip: the graph benchmark set used to evaluate process mapping. Metis format hypergraph_stats.csv: general statistics on the hypergraph instances graph_stats.csv: general statistics on the process mapping (graph) instances results.zip: experimental results. One csv file per algorithm, with one row for each run

提供机构:
Zenodo
创建时间:
2025-05-08
二维码
社区交流群
二维码
科研交流群
商业服务