Approximating the pathwidth of outerplanar graphs

Information Processing Letters

Volumn 68, Issue 1, 1998, Pages 17-23

  Govindan, Rajeev ^a   Langston, Michael A ^b   Yan, Xudong ^c  

^a QUALCOMM INC   (United States)

^b University of Tennessee   (United States)

^c Prism Solutions Inc   (United States)

Author keywords

Algorithms; Approximation; Outerplanar graphs; Pathwidth; Tree decomposition

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; NUMERICAL METHODS; OPTIMIZATION; TREES (MATHEMATICS);

OUTERPLANAR GRAPHS; PATHWIDTH PROBLEM; TREE DECOMPOSITION;

ALGORITHMS;

EID: 0032180182     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00139-2     Document Type: Article

References (12)

1. H.L. Bodlaender, T. Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms 25 (1996) 358-402.
2. H.L. Bodlaender, Classes of graphs with bounded treewidth, Technical Report RUU-CS-86-22, University of Utrecht, The Netherlands, December 1986.
3. N. Deo, M.S. Krishnamoorthy, M.A. Langston, Exact and approximate solutions for the gate matrix layout problem, IEEE Trans. Computer-Aided Design 6 (1987) 79-84.
4. J. Ellis, M. Mata, G. MacGillivray, Linear time algorithms for longest (.s, t)-paths and longest circuits in weighted outerplanar graphs, Technical Report DCS-65-IR, Department of Computer Science, University of Victoria, Victoria, BC, August 1987.
5. J.A. Ellis, I.H. Sudborough, J.S. Turner, The vertex separation and search number of a graph, Inform. and Comput. 113 (August 1994) 50-79.
6. M.R. Fellows, M.A. Langston, On well-partial-order theory and its application to combinatorial problems of VLSI design, SIAM J. Discrete Math. 5(1) (1992) 117-126.
7. R. Govindan, Algorithmic methods for circuit layout and partitioning, Ph.D. Thesis, Department of Computer Science, University of Tennessee, Knoxville, TN, 1998.
8. T. Kashiwabara, T. Fujisawa, NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph, in: Proc. International Symposium on Circuits and Systems, 1979, pp. 657-660.
9. N.G. Kinnersley, The vertex separation of a graph equals its path-width, Inform. Process. Lett. 42 (1992) 345-350.
10. A. Kornai, Z. Tuza, Narrowness, pathwidth, and their application in natural language processing, Discrete Appl. Math. 36 (1992) 87-92.
11. N. Robertson, P.D. Seymour, Graph minors II. Algorithmic aspects of treewidth, J. Algorithms 7 (1986) 309-322.
12. X. Yan, A relative approximation algorithm for computing pathwidth, Master's Thesis, Department of Computer Science, Washington State University, Pullman, WA, 1989.