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, there are extremely few graph classes for which pathwidh is known to be tractable in polynomial time. We give in this paper an O(n2 )-time algorithm computing the pathwidth of circular-arc graphs.

• Type: Conference
• Year: 2007
• Where: WG
• Authors: Karol Suchan, Ioan Todinca
• Keywords: Computer Science, Graph Classes, Minimum Clique Number, Well-studied Graph Parameter, WG 2007