A lower bound for the treewidth of k-outerplanar graphs
- Many optimization problems can be solved efficiently if a tree-decomposition of small width is given. Unfortunately, all known algorithms computing, for general graphs, a tree decomposition of width k, if one exists, have a running time exponential in k. However, Bodlaender observed that each k-outerplanar graph has a tree decomposition of width at most 3k - 1 and his analysis implicitly leads to an O(kn)- time algorithm for computing such a tree-decomposition. In this paper we show that the bound 3k - 1 is tight, i.e., for every k 2 IN, there are k-outerplanar graphs having treewidth 3k - 1.
Author: | Frank Kammer, Torsten Tholey |
---|---|
URN: | urn:nbn:de:bvb:384-opus4-10970 |
Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/1304 |
Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2009-07) |
Type: | Report |
Language: | English |
Publishing Institution: | Universität Augsburg |
Release Date: | 2009/09/02 |
Institutes: | Fakultät für Angewandte Informatik |
Fakultät für Angewandte Informatik / Institut für Informatik | |
Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
Licence (German): | Deutsches Urheberrecht |