Abstract
As this is the final chapter of this overview we should have a look at the ‘recent’ developments in graph algorithmics. To keep this brief short let me select one topic — namely treewidth — and use that as a chassis to explain various ‘recent’ concepts.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Kloks, T., Xiao, M. (2022). Recent Trends. In: A Guide to Graph Algorithms. Springer, Singapore. https://doi.org/10.1007/978-981-16-6350-5_4
Download citation
DOI: https://doi.org/10.1007/978-981-16-6350-5_4
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-6349-9
Online ISBN: 978-981-16-6350-5
eBook Packages: Computer ScienceComputer Science (R0)