Disturbed diffusive processes for solving partitioning problems on graphs

MaRDI QIDQ2922529zbMATH OpenFDO

Authors Henning Meyerhenke

Publication date 11 October 2014

Full work available at URL https://digital.ub.uni-paderborn.de/hs/content/titleinfo/5108, https://digital.ub.uni-paderborn.de/hs/download/pdf/5108?originalFilename=true

zbMATH Keywords

graph clusteringundirected graphheuristic algorithmsdense regions

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Density (toughness, etc.) (05C42) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Beyond good partition shapes: an analysis of diffusive graph partitioning
• Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
• scientific article; zbMATH DE number 2131658
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• scientific article; zbMATH DE number 5761786

Cited in

(4)

• Randomized diffusion for indivisible loads
• Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
• Beyond good partition shapes: an analysis of diffusive graph partitioning
• A diffusion generated method for computing Dirichlet partitions

Describes a project that uses

Uses Software

• DibaP
• JOSTLE
• METIS

This page was built for publication: Disturbed diffusive processes for solving partitioning problems on graphs

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