A 3-approximation for the pathwidth of Halin graphs

Authors:
Fedor V. Fomin;Dimitrios M. Thilikos
Affiliations:
Department of Informatics, University of Bergen N-5020, Bergen, Norway;Departament de Llenguatges i Sistemes Informítics, Universitat Politècnica de Catalunya, E-08034, Barcelona, Spain
Venue:
Journal of Discrete Algorithms
Year:
2006

Citing 15
Cited 5

The complexity of searching a graph

Journal of the ACM (JACM)
Monotonicity in graph searching

Journal of Algorithms
The vertex separation number of a graph equals its path-width

Information Processing Letters
The vertex separation and search number of a graph

Information and Computation
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Approximating the pathwidth of outerplanar graphs

Information Processing Letters
Graph classes: a survey

Graph classes: a survey
Efficient Planarity Testing

Journal of the ACM (JACM)
Algorithms and obstructions for linear-width and related search parameters

Discrete Applied Mathematics
Approximation of pathwidth of outerplanar graphs

Journal of Algorithms
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time

Journal of Algorithms
Computing the vertex separation of unicyclic graphs

Information and Computation
Minimum cycle bases of Halin graphs

Journal of Graph Theory
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Pathwidth of circular-arc graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Mixed search number and linear-width of interval and split graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Fast searching games on graphs

Journal of Combinatorial Optimization
Approximate search strategies for weighted trees

Theoretical Computer Science

Quantified Score

Hi-index	0.02

Visualization

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.