Abstract
The idea of applying a dynamic programming strategy to evaluating certain objective functions on trees is fairly straightforward. The road for this idea to develop into theories of width parameters has been not so straight. Hans Bodlaender has played a major role in the process of mapping out that road. In this sentimental journey, we will recount our collective road trip over the past decades.
Cite
CITATION STYLE
Arnborg, S., & Proskurowski, A. (2020). Seeing Arboretum for the (partial k-) Trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12160 LNCS, pp. 3–6). Springer. https://doi.org/10.1007/978-3-030-42071-0_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
