A 3-approximation for the pathwidth of Halin graphs☆

https://doi.org/10.1016/j.jda.2005.06.004Get rights and content
Under an Elsevier user license
open archive

Abstract

We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings of trees. Using this result we prove that the linear width of Halin graph is always at most three times the linear width of its skeleton.

Keywords

Halin graph
Pathwidth
Linear width

Cited by (0)

☆

Fedor Fomin is supported by Norges forskningsråd project 160778/V30. Dimitrios Thilikos is supported by the EU within the 6th Framework Programme under contract 001907 (DELIS) and by the Spanish CICYT project TIC-2002-04498-C05-03 (TRACER).

Copyright © 2005 Elsevier B.V. All rights reserved.