n-level graph partitioning

DOI10.1007/978-3-642-15775-2_24MaRDI QIDQ3586469zbMATH OpenOpenAlexFDO

Authors Vitaly Osipov, Peter Sanders

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

Recommendations

• Engineering multilevel graph partitioning algorithms
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Multilevel graph partitioning: an evolutionary approach
• Quality matching and local improvement for multilevel graph-partitioning
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs

Cited in

(16)

• SOFSEM 2005: Theory and Practice of Computer Science
• Algorithm 1003: Mongoose, a graph coarsening and partitioning library
• A partitioning requiring rapidity and quality: the multilevel method and partitions refinement algorithms
• Engineering multilevel graph partitioning algorithms
• Tree-based coarsening and partitioning of complex networks
• A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
• Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
• Jet: multilevel graph partitioning on graphics processing units
• Abusing a hypergraph partitioner for unweighted graph partitioning
• Multilevel algorithms for acyclic partitioning of directed acyclic graphs
• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
• Multi-level spectral graph partitioning method
• Multilevel MLA algorithm and its application in graph partitioning problem
• Quality matching and local improvement for multilevel graph-partitioning
• A reactive self-tuning scheme for multilevel graph partitioning
• High quality graph partitioning

This page was built for publication: \(n\)-level graph partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586469)