Recent Advances in Graph Partitioning
arXiv:1311.3144
Abstract
We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions.
References in corpus (2)
Cited by in corpus (13)
- Engineering Parallel Algorithms for Community Detection in Massive Networks
- Efficient Combinatorial Optimization Using Quantum Annealing
- Graph Partitioning with Acyclicity Constraints
- Evolutionary Acyclic Graph Partitioning
- (Semi-)External Algorithms for Graph Partitioning and Clustering
- On Hash-Based Work Distribution Methods for Parallel Best-First Search
- Incorporating Road Networks into Territory Design
- Understanding complexity via network theory: a gentle introduction
- Tree-based Coarsening and Partitioning of Complex Networks
- Streaming Graph Partitioning in the Planted Partition Model
- New Abilities and Limitations of Spectral Graph Bisection
- A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators
- An improved, easily computable combinatorial lower bound for weighted graph bipartitioning