Serial and parallel multilevel graph partitioning using fixed centers

DOI10.1007/978-3-540-30577-4_16MaRDI QIDQ5711525zbMATH OpenOpenAlexFDO

Authors Kayhan Erciyes, Ali Alp, Geoffrey Marshall

Publication date 7 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105088

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• \(n\)-level graph partitioning
• Multilevel algorithm for graph partitioning
• Engineering multilevel graph partitioning algorithms
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

Cited in

(2)

• Engineering multilevel graph partitioning algorithms
• Parallelization domain oriented multilevel graph partitioner

This page was built for publication: Serial and parallel multilevel graph partitioning using fixed centers

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