Graph partitioning for scalable distributed graph computations

MaRDI QIDQ5298935zbMATH OpenFDO

Authors Aydin Buluç, Kamesh Madduri

Publication date 25 June 2013

zbMATH Keywords

2D decompositionbreadth-first searchhypergraph partitioninginter-node communication modeling

Mathematics Subject Classification ID

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

Recommendations

• Scalable edge partitioning
• Distributed balanced partitioning via linear embedding
• Distributed computation of large-scale graph problems
• scientific article; zbMATH DE number 2131658
• Partitioning graphs on message-passing machines by pairwise mincut

Cited in

(9)

• Distributed balanced partitioning via linear embedding
• Complex network partitioning using label propagation
• GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
• Scalable edge partitioning
• Distributed Evolutionary Graph Partitioning
• A novel graph-based partitioning algorithm for large-scale dynamical systems
• Current challenges in parallel graph partitioning
• Graph partitioning: an updated survey
• An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs

Describes a project that uses

Uses Software

• PBGL

This page was built for publication: Graph partitioning for scalable distributed graph computations

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