A Guide to Graph Algorithms - Couverture souple

Kloks, Ton; Xiao, Mingyu

Couverture souple

ISBN 10 : 9811663491 ISBN 13 : 9789811663499

Editeur : Springer, 2022

Synopsis

Chapter 1. Graphs.- Chapter 2. Algorithms.- Chapter 3. Problem Formulations.- Chapter 4. Recent Trends.

A propos du livre

À propos de l?auteur

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.

Détails de l'édition

• Éditeur: Springer
• Date d'édition: 2022
• Langue: anglais
• ISBN 10: 9811663491
• ISBN 13: 9789811663499
• Reliure: Broché
• Numéro d'édition: 1
• Nombre de pages: 356
• Coordonnées du fabricant: non disponible
• Personne responsable: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Allemagne