Current challenges in parallel graph partitioning

DOI10.1016/J.CRME.2010.11.004MaRDI QIDQ553200zbMATH OpenOpenAlexFDO

Authors François Pellegrini

Publication date 26 July 2011

Published in Comptes Rendus. Mécanique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.crme.2010.11.004

zbMATH Keywords

graph partitioningparallel architecture

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10)

Recommendations

• Parallelization of graph partitioning
• Graph partitioning models for parallel computing
• Parallel static and dynamic multi‐constraint graph partitioning
• scientific article; zbMATH DE number 177834
• Graph partitioning for scalable distributed graph computations
• Graph partitioning: an updated survey
• Parallelization domain oriented multilevel graph partitioner

Cited in

(3)

• New challenges in dynamic load balancing
• Parallelization of graph partitioning
• Parallel partitioning with Zoltan: is hypergraph partitioning worth it?

This page was built for publication: Current challenges in parallel graph partitioning

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