Better Bounds for Graph Bisection

DOI10.1007/978-3-642-33090-2_36zbMath1365.68458OpenAlexW2117522609MaRDI QIDQ2912858

Daniel Delling, Renato F. Werneck

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_36

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search, ILP-Based Local Search for Graph Partitioning, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, An exact combinatorial algorithm for minimum graph bisection, Unnamed Item