Parallelization of graph partitioning

MaRDI QIDQ2912416zbMATH OpenFDO

Authors François Pellegrini

Publication date 14 September 2012

zbMATH Keywords

parallel algorithmsparallel graph partitionspartitioning tools

Mathematics Subject Classification ID

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

Recommendations

• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Parallel multilevel algorithms for hypergraph partitioning
• Current challenges in parallel graph partitioning
• A partitioning requiring rapidity and quality: the multilevel method and partitions refinement algorithms
• scientific article; zbMATH DE number 5761786

Cited in

(9)

• Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
• An overview of graph covering and partitioning
• Employee workload balancing by graph partitioning
• Parallel multilevel algorithms for hypergraph partitioning
• Parallelization domain oriented multilevel graph partitioner
• scientific article; zbMATH DE number 927047 (Why is no real title available?)
• Distributed Evolutionary Graph Partitioning
• Current challenges in parallel graph partitioning
• Jet: multilevel graph partitioning on graphics processing units

This page was built for publication: Parallelization of graph partitioning

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