Quality matching and local improvement for multilevel graph-partitioning
- 1 November 2000
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 26 (12), 1609-1634
- https://doi.org/10.1016/s0167-8191(00)00049-1
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Multilevelk-way Partitioning Scheme for Irregular GraphsJournal of Parallel and Distributed Computing, 1998
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel ComputationsSIAM Journal on Scientific Computing, 1995
- TOP/DOMDEC—A software tool for mesh partitioning and parallel processingComputing Systems in Engineering, 1995
- Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problemsConcurrency: Practice and Experience, 1994
- Faster scaling algorithms for general graph matching problemsJournal of the ACM, 1991
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- A survey of heuristics for the weighted matching problemNetworks, 1983
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976