Approximation of pathwidth of outerplanar graphs
From MaRDI portal
Publication:3150282
DOI10.1016/S0196-6774(02)00001-9zbMath1005.68113WikidataQ59567890 ScholiaQ59567890MaRDI QIDQ3150282
Fedor V. Fomin, Hans L. Bodlaender
Publication date: 30 September 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Related Items
Circumference and Pathwidth of Highly Connected Graphs, A 3-approximation for the pathwidth of Halin graphs, A 3-approximation for the pathwidth of Halin graphs, On self-duality of branchwidth in graphs of bounded genus, Tree \(t\)-spanners in outerplanar graphs via supply demand partition, Computing the vertex separation of unicyclic graphs, Linear-time algorithms for problems on planar graphs with fixed disk dimension, Approximate search strategies for weighted trees, Non-deterministic graph searching in trees, Connected Graph Searching in Outerplanar Graphs, Pathwidth of Circular-Arc Graphs