The pathwidth and treewidth of cographs-Reference-Cited by-同舟云学术

The pathwidth and treewidth of cographs

Published:1990 Issue: Volume: Page:301-309
ISSN:0302-9743
Container-title:SWAT 90
language:
Short-container-title:

Author:

Bodlaender Hans L.,Möhring Rolf H.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-52846-6_99.pdf

Reference18 articles.

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. Technical Report;H.L. Bodlaender,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.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reducing Graph Parameters by Contractions and Deletions;Algorithmica;2023-07-09

2. Directed Path-Width and Directed Tree-Width of Directed Co-graphs;Lecture Notes in Computer Science;2018

3. Linear Layout Problems;Handbook of Heuristics;2018

4. Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem;Computers & Operations Research;2014-12

5. Linear Rank-Width and Linear Clique-Width of Trees;Graph-Theoretic Concepts in Computer Science;2013