High quality graph partitioning

MaRDI QIDQ5298929zbMATH OpenFDO

Authors Peter Sanders, Christian Schulz

Publication date 25 June 2013

zbMATH Keywords

graph partitioningKaFFPaKaFFPaE

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Distributed Evolutionary Graph Partitioning
• Engineering multilevel graph partitioning algorithms
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• \(n\)-level graph partitioning
• Multilevel graph partitioning: an evolutionary approach

Cited in

(7)

• Partitioning a reaction–diffusion ecological network for dynamic stability
• A Statistical Performance Analysis of Graph Clustering Algorithms
• The isodominism class of the graphs
• 3D geo-graphs: efficient flip verification for the spherical zoning problem
• Mobility offer allocations in corporate settings
• Fission: Practical algorithms for computing minimum balanced node separators
• Structure of the space of taboo-free sequences

This page was built for publication: High quality graph partitioning

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