scientific article; zbMATH DE number 2044933

MaRDI QIDQ4448756zbMATH OpenFDO

Authors Fedor V. Fomin, Hans L. Bodlaender

Publication date 18 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2204/22040166.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximation of pathwidth of outerplanar graphs
• Approximating the pathwidth of outerplanar graphs
• Pathwidth of outerplanar graphs
• 2-connecting outerplanar graphs without blowing up the pathwidth
• Computing Pathwidth Faster Than 2 n

Cited in

(13)

• A polynomial-time algorithm for outerplanar diameter improvement
• Outerplanar obstructions for matroid pathwidth
• Approximating the pathwidth of outerplanar graphs
• Approximation of pathwidth of outerplanar graphs
• A polynomial-time algorithm for outerplanar diameter improvement
• Pathwidth of outerplanar graphs
• Determining the Smallest k Such That G Is k-Outerplanar
• Outerplanar obstructions for matroid pathwidth
• A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs
• 2-connecting outerplanar graphs without blowing up the pathwidth
• A 3-approximation for the pathwidth of Halin graphs
• Graph classes and the switch Markov chain for matchings
• 2-connecting outerplanar graphs without blowing up the pathwidth

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448756)