Approximation of pathwidth of outerplanar graphs

Authors:
Hans L. Bodlaender;Fedor V. Fomin
Affiliations:
Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands;Graduiertenkolleg des PaSCo, Heinz Nixdorf Institut and University of Paderborn, Fürstenallee 11, D-33102 paderborn, Germany
Venue:
Journal of Algorithms
Year:
2002

Citing 5
Cited 7

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
Approximating the pathwidth of outerplanar graphs

Information Processing Letters
Treewidth: Algorithmoc Techniques and Results

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science

Computing the vertex separation of unicyclic graphs

Information and Computation
Cutwidth II: algorithms for partial w-trees of bounded degree

Journal of Algorithms
A 3-approximation for the pathwidth of Halin graphs

Journal of Discrete Algorithms
Linear-time algorithms for problems on planar graphs with fixed disk dimension

Information Processing Letters
Cutwidth II: Algorithms for partial w-trees of bounded degree

Journal of Algorithms
Pathwidth of circular-arc graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Approximate search strategies for weighted trees

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs, but the large exponent makes this algorithm impractical. In this paper, we give an algorithm that, given a biconnected outerplanar graph G, finds a path decomposition of G of pathwidth at most twice the pathwidth of G plus one. To obtain the result, several relations between the pathwidth of a biconnected outerplanar graph and its dual are established.