✦ LIBER ✦

The Pathwidth and Treewidth of Cographs

✍ Scribed by Bodlaender, Hans L.; Möhring, Rolf H.

Book ID: 118197523
Publisher: Society for Industrial and Applied Mathematics
Year: 1993
Tongue: English
Weight: 940 KB
Volume: 6
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0406014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The structure of obstructions to treewid

The structure of obstructions to treewidth and pathwidth

✍ Janka Chlebíková 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Approximating Treewidth, Pathwidth, Fron

Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree

✍ H.L. Bodlaender; J.R. Gilbert; H. Hafsteinsson; T. Kloks 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 813 KB

Efficient and Constructive Algorithms fo

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

✍ Hans L. Bodlaender; Ton Kloks 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 373 KB

In this paper we give, for all constants k, l, explicit algorithms that, given a graph Ž . Gs V,E with a tree-decomposition of G with treewidth at most l, decide Ž . whether the treewidth or pathwidth of G is at most k, and, if so, find a Ž . tree-decomposition or path-decomposition of G of width at

[Lecture Notes in Computer Science] Theo

[Lecture Notes in Computer Science] Theory and Applications of Models of Computation Volume 4484 || On the Treewidth and Pathwidth of Biconvex Bipartite Graphs

✍ Cai, Jin-Yi; Cooper, S. Barry; Zhu, Hong 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 517 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 570 || Approximating treewidth, pathwidth, and minimum elimination tree height

✍ Schmidt, Gunther; Berghammer, Rudolf 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 748 KB

Pathwidth of outerplanar graphs

✍ David Coudert; Florian Huc; Jean-Sébastien Sereni 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

## Abstract We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geo