(Semi-)External Algorithms for Graph Partitioning and Clustering

DOI10.1137/1.9781611973754.4zbMath1429.68163arXiv1404.4887OpenAlexW293820751MaRDI QIDQ5232520

Christian Schulz, Yaroslav Akhremtsev, Peter Sanders

Publication date: 12 September 2019

Published in: 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4887

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Practical Minimum Cut Algorithms

This page was built for publication: (Semi-)External Algorithms for Graph Partitioning and Clustering