Vertex Bisection is hard, too (2009)
Cached
Download Links
by
Ulrik Brandes
,
Daniel Fleischer
BibTeX
@MISC{Brandes09vertexbisection,
author = {Ulrik Brandes and Daniel Fleischer},
title = {Vertex Bisection is hard, too},
year = {2009}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We settle an open problem mentioned in Diaz, Petit, and Serna: A survey of graph layout problems (ACM Computing Surveys 34:313–356, 2002). Of eight objectives considered in that survey, only the complexity status of minimum vertex bisection is listed as unknown. We show that both minimum and maximum vertex bisection are N P-hard, but polynomially solvable on special graph classes such as hypercubes and trees.
