The pathwidth and treewidth of cographs

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

Volumn 447 LNCS, Issue , 1990, Pages 301-309

  Bodlaender, Hans L ^a   Möhring, Rolf H ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

CO-GRAPHS; COGRAPH; LINEAR-TIME ALGORITHMS; PATH DECOMPOSITION; PATHWIDTH; TREE-WIDTH;

GRAPH THEORY;

EID: 85031917265     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52846-6_99     Document Type: Conference Paper

References (18)

1. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A Survey. BIT, 25:2-23, 1985.
2. S. Arnborg, D.G. Corneil and A. Proskurowski. Complexity of finding embeddings in a κ-tree. SIAM J. Alg. Disc. Meth., 8:277-284, 1987.
3. H.L. Bodlaender. Classes of graphs with bounded treewidth. Technical Report RUU-CS-86- 22, Dept. of Computer Science, University of Utrecht, Utrecht, 1986.
4. H.L. Bodlaender. Dynamic programming algorithms on graphs with bounded tree-width. Techn. rep., Lab. for Computer Science, M.I.T., 1987. Ext. abstract in proceedings ICALP 88.
5. H.L. Bodlaender. Improved self-reduction algorithms for graphs with bounded treewidth. Technical Report RUU-CS-88-29, Dept. of Computer Science, Univ. of Utrecht, 1988. To appear in: Proc. Workshop on Graph Theoretic Concepts in Comp. Sc. '89.
6. D.G. Corneil, H. Lerchs, and L. Stewart Burlingham. Complement reducible graphs, Disc. Appl. Math. 3: 163-174, 1981.
7. D.G Corneil, Y. Perl and L. Stewart. A linear recognition algorithm for cographs. SIAM d. Comput., 4:926-934, 1985.
8. J. Ellis, I.H. Sudborough, and J. Turner. Graph separation and search number. Report DCS-66-IR, University of Victoria, 1987.
9. M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
10. J. Gustedt. Path width for chordal graphs is NP-complete. Preprint TU Berlin, 1989.
11. L.M. Kirousis and C.H. Papadimitriou. Interval graphs and searching. Disc. Math., 55:181-184, 1985.
12. L.M. Kirousis and C.H. Papadimitriou. Searching and pebbling. Theor. Comp. Sc., 47:205-218, 1986.
13. R.H. Möhring. Graph problems related to gate matrix layout and PLA folding. Technical Report 223/11989, Department of Mathematics, Technical University of Berlin, 1989.
14. M.B. Novick. Fast parallel algorithms for the modular decomposition. Technical Report TR 89-1016, Department of Computer Science, Cornell University, 1989.
15. N. Robertson and P. Seymour. Graph minors. I. Excluding a forest. J. Comb. Theory Series B, 35:39-61, 1983.
16. N. Robertson and P. Seymour. Graph minors. II. Algorithmic aspects of tree-width, d. Algorithms, 7:309-322, 1986.
17. N. Robertson and P. Seymour. Graph minors. XIII. The disjoint paths problem. Manuscript, 1986.
18. P. Scheffler. Die Baumweite yon Graphen als ein Maß für die Kompliziertheit algorithmischer Probleme. PhD thesis, Akademie der Wissenschaften der DDR, Berlin, 1989.