Abstract
We investigate fixed-parameter aspects of the notion of special treewidth, which was recently introduced by Courcelle [8,9]. In a special tree decomposition, for each vertex v, the bags containing v form a rooted path in decomposition tree. We resolve an open problem by Courcelle, and show that an algorithm by Bodlaender and Kloks [7] can be modified to obtain for each fixed k, a linear time algorithm that decides if the special treewidth of a given graph is at most k, and if so, finds a corresponding special tree decomposition. This establishes that special treewidth is fixed-parameter tractable.
We obtain characterizations for the class of graphs of special treewidth at most two. The first characterization consists of certain linear structures (termed mambas, or equivalently, biconnected partial two-paths) arranged in a specific tree-like fashion, building upon characterizations of biconnected graphs of treewidth two or of pathwidth two. We show that the class of graphs of special treewidth at most two is closed under taking of minors, and give explicitly the obstruction set for this class. For k ≥ 3, the class of graphs of special treewidth at most k is not closed under taking minors.
This work was partially supported by the Netherlands Organization for Scientific Research (N.W.O.), project ”KERNELS: Combinatorial Analysis of Data Reduction”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Archdeacon, D.: A Kuratowski theorem for the projective plane. Journal of Graph Theory 7, 325–334 (1983)
Arnborg, S., Proskurowski, A., Corneil, D.G.: Forbidden minors characterization of partial 3-trees. Discrete Mathematics 80, 1–19 (1990)
Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25, 1305–1317 (1996)
Bodlaender, H.L., de Fluiter, B.: On intervalizing k-colored graphs for DNA physical mapping. Discrete Applied Mathematics 71, 55–77 (1996)
Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A O(c k n) 5-approximation algorithm for treewidth. CoRR, abs/1304.6321 (2013), Extended abstract to appear in FOCS 2013
Bodlaender, H.L., Kloks, T.: A simple linear time algorithm for triangulating three-colored graphs. Journal of Algorithms 15, 160–172 (1993)
Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms 21, 358–402 (1996)
Courcelle, B.: Special tree-width and the verification of monadic second-order graph properties. In: FSTTCS. LIPIcs, vol. 8, pp. 13–29. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)
Courcelle, B.: On the model-checking of monadic second-order formulas with edge set quantifications. Discrete Applied Mathematics 160, 866–887 (2012)
de Fluiter, B.: Algorithms for Graphs of Small Treewidth. PhD thesis, Utrecht University (1997)
Diestel, R.: Graph theory, 4th edn. Springer (2010)
Kinnersley, N.G., Langston, M.A.: Obstruction set isolation for the gate matrix layout problem. Discrete Applied Mathematics 54, 169–213 (1994)
Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. Journal of Combinatorial Theory, Series B 35, 39–61 (1983)
Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 309–322 (1986)
Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner’s conjecture. Journal of Combinatorial Theory, Series B 92, 325–357 (2004)
Wagner, K.: Über eine Eigenshaft der ebenen Complexe. Math. Ann. 14, 570–590 (1937)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodlaender, H.L., Kratsch, S., Kreuzen, V.J.C. (2013). Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. In: Brandstädt, A., Jansen, K., Reischuk, R. (eds) Graph-Theoretic Concepts in Computer Science. WG 2013. Lecture Notes in Computer Science, vol 8165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45043-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-45043-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45042-6
Online ISBN: 978-3-642-45043-3
eBook Packages: Computer ScienceComputer Science (R0)