Pathwidth of Circular-Arc Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

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(n^2)-time algorithm computing the pathwidth of circular-arc graphs.

Dates and versions

hal-00462302 , version 1 (09-03-2010)



Karol Suchan, Ioan Todinca. Pathwidth of Circular-Arc Graphs. Graph-Theoretic Concepts in Computer Science (WG 2007), Jun 2007, Dornburg, Germany. pp.258-269, ⟨10.1007/978-3-540-74839-7_25⟩. ⟨hal-00462302⟩
47 View
0 Download



Gmail Mastodon Facebook X LinkedIn More