Abstract
In the previous chapter, we saw that many graph problems that are hard in general become tractable when restricted to input graphs of bounded tree width. We have also seen examples of hard problems that become tractable on graphs of bounded degree (the parameterized dominating set problem is an example, see Corollary 1.20).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Planarity and Bounded Local Tree Width. In: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-29953-X_12
Download citation
DOI: https://doi.org/10.1007/3-540-29953-X_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29952-3
Online ISBN: 978-3-540-29953-0
eBook Packages: Computer ScienceComputer Science (R0)