This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
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...
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 alg...