Dataset
Synthetic Uniform, Harder
Uniform random matching synthetic benchmark with the weakest v1 uniform connectivity.
Graph Summary
A hard benchmark for acceleration and sparse solver choices.
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 the weakest uniform connectivity in this collection.
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) | 83.5 |
| MAP-SD | (Gaure 2013) | 49.8 |
| MAP-CG-Sym | (Correia 2016) | 47.2 |
| MAP+Prune | (Correia 2016) | 50.0 |
| LSMR | (Gomez 2016) | 124.2 |