Blar i Department of Informatics på emneord "Cutwidth"
Viser treff 1-2 av 2
-
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 ... -
A polynomial-time solvable case for the NP-hard problem Cutwidth
(Master thesis, 2014-06-02)The Cutwidth problem is a notoriously hard problem, and its complexity is open on several interesting graph classes. Motivated by this fact we investigate the problem on superfragile graphs, a graph class on which the ...