Approximation of pathwidth of outerplanar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2204, Issue , 2001, Pages 166-176

  Fomin, Fedor V ^a   Bodlaender, Hans L ^b  

^a ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

OUTER PLANAR GRAPHS; OUTERPLANAR GRAPH; PATH DECOMPOSITION; PATHWIDTH; POLYNOMIAL-TIME ALGORITHMS;

GRAPH THEORY;

EID: 33645666782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45477-2_16     Document Type: Conference Paper

References (10)

1. 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.
2. A partial k-arboretum of graphs with bounded treewidth, Theor. Comp. Sc., 209 (1998), pp. 1-45.
3. H. L. BODLAENDER AND T. KLOKS Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms, 21 (1996), pp. 358-402.
4. 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.
5. R. GOVINDRAN, M. A. LANGSTON, AND X. YAN, Approximating the pathwidth of outerplanar graphs, Inform. Proc. Letters, 68 (1998), pp. 17-23.
6. S. L. MITCHELL, Linear algorithms to recognize outerplanar and maximal outer-planar graphs, Inform. Proc. Letters, 9 (1979), pp. 229-232.
7. 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. Syslo, eds., Springer Verlag, 1990, pp. 17-51.
8. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. I. Exccluding a forest, J. Comb. Theory Series B, 35 (1983), pp. 39-61.
9. 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.
10. M. M. SYSLO, Characterisations of outerplanar graphs, Disc. Math., 26 (1979), pp. 47-53.