Approximation of Pathwidth of Outerplanar Graphs [chapter]

Fedor V. Fomin, Hans L. Bodlaender
2001 Lecture Notes in Computer Science  
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 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.
doi:10.1007/3-540-45477-2_16 fatcat:xeri43chz5bzdomulyi6wkytdy