Tree-Based Coarsening and Partitioning of Complex Networks


A hierarchy of increasingly coarse versions of a network allows one to represent the network on multiple scales at the same time. Often, the elementary operation for generating a hierarchy on a network is merging adjacent vertices, an operation that can be realized through contracting the edge between the two vertices. Such a hierarchy is defined by the… (More)
DOI: 10.1145/2851496


8 Figures and Tables


Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Glantz2014TreeBasedCA, title={Tree-Based Coarsening and Partitioning of Complex Networks}, author={Roland Glantz and Henning Meyerhenke and Christian Schulz}, booktitle={SEA}, year={2014} }