Tree-Based Coarsening and Partitioning of Complex Networks
From MaRDI portal
Publication:5266614
DOI10.1145/2851496zbMath1365.68355OpenAlexW2298648390MaRDI QIDQ5266614
Roland Glantz, Christian Schulz, Henning Meyerhenke
Publication date: 16 June 2017
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2851496
complex networksconductancespanning treesgraph coarseningmultilevel graph partitioningfundamental cuts
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
- Graph partitioning models for parallel computing
- A combined evolutionary search and multilevel optimisation approach to graph-partitioning
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- Efficient graph-based image segmentation
- Advanced Coarsening Schemes for Graph Partitioning
- Algebraic Distance on Graphs
- Fast computation of small cuts via cycle space sampling
- On clusterings
- n-Level Graph Partitioning
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Tree-Based Coarsening and Partitioning of Complex Networks
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- A general framework for graph sparsification
- Engineering Algorithms for Approximate Weighted Matching
- Depth-First Search and Linear Graph Algorithms
- Networks
