Approximation of pathwidth of outerplanar graphs

DOI10.1016/S0196-6774(02)00001-9zbMath1005.68113WikidataQ59567890 ScholiaQ59567890MaRDI QIDQ3150282

Hans L. Bodlaender, Fedor V. Fomin

Publication date: 30 September 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

outerplanar graphs

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

Related Items

Computing the vertex separation of unicyclic graphs