Vertex Bisection is Hard, too
From MaRDI portal
Publication:3184606
DOI10.7155/jgaa.00179zbMath1172.05348OpenAlexW2124441581MaRDI QIDQ3184606
Ulrik Brandes, Daniel Fleischer
Publication date: 21 October 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00179
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A variable neighborhood search approach for the vertex bisection problem ⋮ On the parameterized complexity of computing balanced partitions in graphs ⋮ Isoperimetry in integer lattices ⋮ Two new integer linear programming formulations for the vertex bisection problem ⋮ Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations
