Abstract
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], 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.
The work of this author was done in part while he was at the Centro de Modelamiento Matemático, Universidad de Chile and UMR 2071-CNRS, supported by FONDAP and while he was a visiting postdoc at DIMATIA-ITI partially supported by GAČR 201/99/0242 and by the Ministry of Education of the Czech Republic as project LN00A056.
The research of this author was partially supported by EC contract IST-1999-14186: Project ALCOM-FT (Algorithms and Complexity — Future Technologies).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. L. Bodlaender, Treewidth: Algorithmic techniques and results, in Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS’97, Lecture Notes in Computer Science, volume 1295, I. Privara and P. Ruzicka, eds., Berlin, 1997, Springer-Verlag, pp. 19–36.
H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theor. Comp. Sc., 209 (1998), pp. 1–45.
H. L. Bodlaender and T. Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms, 21 (1996), pp. 358–402.
J. A. Ellis, I. H. Sudborough, and J. Turner, The vertex separation and search number of a graph, Information and Computation, 113 (1994), pp. 50–79.
R. Govindran, M. A. Langston, and X. Yan, Approximating the pathwidth of outerplanar graphs, Inform. Proc. Letters, 68 (1998), pp. 17–23.
S. L. Mitchell, Linear algorithms to recognize outerplanar and maximal outerplanar graphs, Inform. Proc. Letters, 9 (1979), pp. 229–232.
R. H. Möhring, Graph problems related to gate matrix layout and PLA folding, in Computational Graph Theory, Comuting Suppl. 7, E. Mayr, H. Noltemeier, and M. SysGlo, eds., Springer Verlag, 1990, pp. 17–51.
N. Robertson and P. D. Seymour, Graph minors. I. Excluding a forest, J. Comb. Theory Series B, 35 (1983), pp. 39–61.
K. Skodinis, Computing optimal linear layouts of trees in linear time, in Proceedings 8th Annual European Symposium on Algorithms, ESA’00, Lecture Notes in Computer Science, volume 1879, M. Paterson, ed., Berlin, 2000, Springer-Verlag, pp. 403–414.
M. M. Sysło, Characterisations of outerplanar graphs, Disc. Math., 26 (1979), pp. 47–53.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fomin, F.V., Bodlaender, H.L. (2001). Approximation of Pathwidth of Outerplanar Graphs. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-45477-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42707-0
Online ISBN: 978-3-540-45477-9
eBook Packages: Springer Book Archive