Pathwidth of circular-arc graphs

Authors:
Karol Suchan;Ioan Todinca
Affiliations:
Departamento de Ingeniería Matemática, Universidad de Chile, Santiago, Chile and Department of Discrete Mathematics, Faculty of Applied Mathematics, AGH, Cracow, Poland;LIFO, Université d'Orléans, Orléans Cedex 2, France
Venue:
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Year:
2007

Citing 11
Cited 8

The complexity of searching a graph

Journal of the ACM (JACM)
The vertex separation and search number of a graph

Information and Computation
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Minimum fill-in on circle and circular-arc graphs

Journal of Algorithms
Approximation of pathwidth of outerplanar graphs

Journal of Algorithms
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time

Journal of Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Computing the vertex separation of unicyclic graphs

Information and Computation
A 3-approximation for the pathwidth of Halin graphs

Journal of Discrete Algorithms
Characterizing minimal interval completions towards better understanding of profile and pathwidth

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Mixed Search Number of Permutation Graphs

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Edge Search Number of Cographs in Linear Time

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Pathwidth is NP-Hard for Weighted Trees

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Reconfiguration of the routing in WDM networks with two classes of services

ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
A constant factor approximation algorithm for boxicity of circular arc graphs

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Edge search number of cographs

Discrete Applied Mathematics
Approximate search strategies for weighted trees

Theoretical Computer Science
Computing directed pathwidth in O(1.89n) time

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation

Quantified Score

Hi-index	0.01

Visualization

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