Blar i Department of Informatics på emneord "Polynomial kernel"
Viser treff 1-1 av 1
-
On cutwidth parameterized by vertex cover
(Peer reviewed; Journal article, 2014-04)We study the CUTWIDTH problem, where the input is a graph G, and the objective is find a linear layout of the vertices that minimizes the maximum number of edges intersected by any vertical line inserted between two ...