Graphs and results for the minimum vertex separator problem
The archive contains real and artificialy constructed instances (from the real world graphs) that can be difficult for the VSP solvers.
>>Link to the benchmark<<
Paper: W. Hager, J. Hungerford, I. Safro, "A Multilevel Bilinear Programming Algorithm for the Minimum Vertex Separator Problem", submitted, 2014, download
|
|
Potentially hard graphs for k-partitioning solvers
The archive contains artificialy constructed instances (from real world graphs) that can be difficult for graph k-partitioning solvers.
>>Link to the benchmark<<
Paper: I. Safro, P. Sanders, C. Schulz, "Advanced Coarsening Schemes for Graph Partitioning", SEA, LNCS Vol. 7276, pp. 369-380, 2012, download
|
|
Benchmark for the minimum logarithmic arrangement problem
The archive contains a benchmark with directed and undirected graphs and numerical results for them. The numerical results for this problem are of particular interest because of their importance for the large-scale network compression.
>>Link to the benchmark<<
Paper: I. Safro, B. Temkin, "Multiscale approach for the network compression-friendly ordering", Journal of Discrete Algorithms, Vol. 9, pp. 190-202, 2011
|
|