Dataset
Synthetic Uniform, Hard
Uniform random matching synthetic benchmark with weaker connectivity.
Graph Summary
Stresses iterative methods more than the easy uniform case.
The primary benchmark graph is built from unique (id1, id2) pairs. The figure shows a binned sparsity pattern of the bipartite incidence block, with both partitions relabeled to contiguous integer identifiers. This block is the off-diagonal part of the corresponding graph Laplacian.
Variables
Columns in the clean CSV:
The v1 graph uses id1 and id2. No additional identifier-like columns are included in this clean v1 CSV.
Source Notes
Generated by the synthetic uniform-matching benchmark scripts included with this collection.
Uniform random matching benchmark with weaker connectivity.
Creation Files
The synthetic data-generating files are included for researchers who want to inspect or adapt the construction.
Historical Benchmark
2017 SEC benchmark timings for this dataset, in seconds:
| Method | Citation | Seconds |
|---|---|---|
| MAP-Aitken | (Guimaraes 2012) | 19.0 |
| MAP-SD | (Gaure 2013) | 21.8 |
| MAP-CG-Sym | (Correia 2016) | 16.1 |
| MAP+Prune | (Correia 2016) | 22.7 |
| LSMR | (Gomez 2016) | 32.1 |