The vertex separation and search number of a graph
Information and Computation
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Approximating the pathwidth of outerplanar graphs
Information Processing Letters
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Computing Optimal Linear Layouts of Trees in Linear Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Generating Outerplanar Graphs Uniformly at Random
Combinatorics, Probability and Computing
| Hi-index | 0.00 |
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an algorithm, that given a biconnected outerplanar graph G, finds a path decomposition of G of pathwidth at most twice the pathwidth of G plus one. To obtain the result, several relations between the pathwidth of a biconnected outerplanar graph and its dual are established.