Sciweavers

WG
2007
Springer
14 years 5 months ago
Pathwidth of Circular-Arc Graphs
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
Karol Suchan, Ioan Todinca
FAW
2009
Springer
134views Algorithms» more  FAW 2009»
14 years 5 months ago
Pathwidth is NP-Hard for Weighted Trees
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
Rodica Mihai, Ioan Todinca