Quality matching and local improvement for multilevel graph-partitioning
From MaRDI portal
Publication:1583343
DOI10.1016/S0167-8191(00)00049-1zbMath0948.68131OpenAlexW2088687202WikidataQ128091916 ScholiaQ128091916MaRDI QIDQ1583343
Robert Preis, Ralf Diekmann, Burkhard Monien
Publication date: 26 October 2000
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00049-1
Related Items (8)
Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ Upper bounds on the bisection width of 3- and 4-regular graphs ⋮ TRANSPORT IN DYNAMICAL ASTRONOMY AND MULTIBODY PROBLEMS ⋮ Weighted matching in the semi-streaming model ⋮ Implicit computation of maximum bipartite matchings by sublinear functional operations ⋮ Local expansion concepts for detecting transport barriers in dynamical systems ⋮ New methods in celestial mechanics and mission design ⋮ A simple approximation algorithm for the weighted matching problem
Uses Software
This page was built for publication: Quality matching and local improvement for multilevel graph-partitioning
