Abstract
In this chapter we consider more sophisticated dynamic-programming routines for graphs of bounded treewidth, compared with the classic ones described in Chapter 7. We give examples of algorithms based on subset convolution, Cut & Count and rank-based approaches.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Cygan, M. et al. (2015). Improving dynamic programming on tree decompositions. In: Parameterized Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-319-21275-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-21275-3_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21274-6
Online ISBN: 978-3-319-21275-3
eBook Packages: Computer ScienceComputer Science (R0)