Overview
- Discusses in depth the treewidth and graph algorithms
- Equips readers to handle complex NP-complete problems
- Treats both theoretical and practical aspects of algorithms
Buy print copy
About this book
Similar content being viewed by others
Keywords
Table of contents (4 chapters)
Reviews
Authors and Affiliations
About the authors
Dr. Ton Kloks is a researcher of graph algorithms. He studied mathematics at Eindhoven University in the Netherlands during the 1980s. He received his PhD in computer science from Utrecht University in The Netherlands in 1993 for his thesis on treewidth. He has authored 179 papers and the total number of citations is more than 5000.
Mingyu Xiao is a professor and vice dean of the School of Computer Science and Engineering, University of Electronic Science and Technology of China. He received his PhD in computer science from the Chinese University of Hong Kong in 2008. He is known for his work in exact and parameterized algorithms, autonomous agents and multi-agent systems, optimization, and so on. He designed the best exact algorithms for more than 10 basic NP-hard problems, including the famous maximum independent set problem. He has authored or co-authored close to hundred papers in prestigious journals and conferences, including AAAI, IJCAI, WWW, AAMAS, ICALP, I&C, JCSS, and Algorithmica. He served as a conference chair/ PC chair/area chair for FAW 2017, IJCAI 2017, NCTCS 2020, and ICCCS 2021, and a PC member for more than 20 prestigious conferences.
Bibliographic Information
Book Title: A Guide to Graph Algorithms
Authors: Ton Kloks, Mingyu Xiao
DOI: https://doi.org/10.1007/978-981-16-6350-5
Publisher: Springer Singapore
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2022
Softcover ISBN: 978-981-16-6349-9Published: 23 February 2022
eBook ISBN: 978-981-16-6350-5Published: 22 February 2022
Edition Number: 1
Number of Pages: XV, 340
Number of Illustrations: 1 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Graph Theory, Algorithms, Discrete Mathematics in Computer Science