Lower bounds on treespan

Authors:
Dieter Rautenbach
Affiliations:
Forschungsinstitut für Diskrete Mathematik, Lennéstr. 2, D-53113 Bonn, Germany
Venue:
Information Processing Letters
Year:
2005

Citing 3
Cited 0

Graphs with small bandwidth and cutwidth

Discrete Mathematics
Bandwidth of the complete k-ary tree

Discrete Mathematics
A survey of graph layout problems

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.89

Visualization

Abstract

Recently Fomin, Heggernes and Telle [Algorithmica 41 (2004) 73] introduced the notion of the treespan of a graph as a natural extension of the well-known bandwidth. They motivate this new concept from different viewpoints involving graph searching, tree decompositions and elimination orderings. In the present paper we prove several lower bounds on the treespan.