Abstract
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 Ο(n2)-time algorithm computing the pathwidth of circular-arc graphs. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Suchan, K., & Todinca, I. (2007). Pathwidth of circular-arc graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4769 LNCS, pp. 258–269). Springer Verlag. https://doi.org/10.1007/978-3-540-74839-7_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
