Parallelization of graph partitioning
From MaRDI portal
Publication:2912416
zbMATH Open1254.05158MaRDI QIDQ2912416FDOQ2912416
Authors: François Pellegrini 
Publication date: 14 September 2012
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
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)
Cited In (9)
- An overview of graph covering and partitioning
- Current challenges in parallel graph partitioning
- Parallel multilevel algorithms for hypergraph partitioning
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
- Distributed Evolutionary Graph Partitioning
- Employee workload balancing by graph partitioning
- Jet: multilevel graph partitioning on graphics processing units
- Title not available (Why is that?)
- Parallelization domain oriented multilevel graph partitioner
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)
