Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
From MaRDI portal
Publication:525113
DOI10.1007/s10732-016-9315-8zbMath1360.90305MaRDI QIDQ525113
Peter Sanders, Christian Schulz, Henning Meyerhenke
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
heuristics; label propagation; aggressive graph coarsening; multilevel graph partitioning; size-constrained graph clustering
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Uses Software