Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
type: Item
instance of: scholarly article
title: Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
zbMATH Open document ID: 1360.90305
author: Henning Meyerhenke
author: Christian Schulz
author: Peter Sanders
published in: Journal of Heuristics
publication date: 2017-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6708818
zbMATH Keywords: multilevel graph partitioning
zbMATH Keywords: size-constrained graph clustering
zbMATH Keywords: heuristics
zbMATH Keywords: label propagation
zbMATH Keywords: aggressive graph coarsening
describes a project that uses: KaFFPa
describes a project that uses: SNAP
describes a project that uses: JOSTLE
describes a project that uses: hMETIS
describes a project that uses: Scotch
describes a project that uses: DIMACS
describes a project that uses: KaHIP
describes a project that uses: kMetis
MaRDI profile type: Publication
full work available at URL: s10732-016-9315-8
OpenAlex ID: W2529573338
cites work: Local metaheuristics and graph partitioning
cites work: Finding good approximate vertex and edge partitions is NP-hard
cites work: Graph partitioning models for parallel computing
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
cites work: On the Analysis of a Label Propagation Algorithm for Community Detection
cites work: Q5298943
cites work: Multilevel refinement for combinatorial optimisation problems
cites work: Multilevel local search algorithms for modularity clustering
cites work: Engineering Multilevel Graph Partitioning Algorithms
cites work: Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
DOI: 10.1007/S10732-016-9315-8
description: scientific article; zbMATH DE number 6708818