n-Level Graph Partitioning

DOI10.1007/978-3-642-15775-2_24zbMath1287.05152OpenAlexW1910169892MaRDI QIDQ3586469

Peter Sanders, Vitaly Osipov

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_24

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Tree-Based Coarsening and Partitioning of Complex Networks

This page was built for publication: n-Level Graph Partitioning