Recent Advances in Graph Partitioning

By Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz. Algorithm Engineering, 2013

614 citations recorded by the source corpus.

We survey recent trends in practical algorithms for balanced graph partitioning, point to applications and discuss future research directions.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/fc4a3dc48a1e209a87829919fb237c5c7f7ae357

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

1. Yongjiang Liang
2. Peixiang Zhao

Citations in the corpus

• Similarity Search in Graph Databases: A Multi-Layered Indexing Approach (2017, background): “However, graph partitioning turns out to be a hard problem [6], and a random partitioning oftentimes yields subgraphs with limited pruning capabilities.”