Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering

DOI10.1007/s10732-016-9315-8zbMath1360.90305MaRDI QIDQ525113

Henning Meyerhenke, Christian Schulz, Peter Sanders

Publication date: 28 April 2017

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-016-9315-8

zbMATH Keywords

heuristics; label propagation; aggressive graph coarsening; multilevel graph partitioning; size-constrained graph clustering

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Tree-Based Coarsening and Partitioning of Complex Networks, SCLaP, Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering, Complex Network Partitioning Using Label Propagation

Uses Software

• SNAP
• SNAP
• JOSTLE
• KaFFPa
• Scotch
• DIMACS
• hMETIS
• KaHIP
• kMetis

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
• Multilevel refinement for combinatorial optimisation problems
• Finding good approximate vertex and edge partitions is NP-hard
• Graph partitioning models for parallel computing
• Engineering Multilevel Graph Partitioning Algorithms
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
• Multilevel local search algorithms for modularity clustering
• On the Analysis of a Label Propagation Algorithm for Community Detection