Blar i Department of Informatics på forfatter "Lilleeng, Simen"
-
A polynomial-time solvable case for the NP-hard problem Cutwidth
Lilleeng, Simen (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 ...