A Guide to Graph Algorithms

ISBN-13: 9789811663499 / Angielski / Miękka / 2022 / 358 str.

Mingyu Xiao

Recenzje

"This book provides a guided tour through the research area of graph algorithms. ... the authors give a good survey on recent topics in graph algorithms, which are supported by results from theory. ... One of the main advantages of this book are its exercises. The exercises are the source for further research. In summary, this book is a good candidate for a course on graph algorithms intended for last year undergraduates or early graduate students in computer science." (Ali Shakiba, zbMATH 1496.68003, 2022)

Spis treści

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

O autorze

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.

Blurb

This book A Guide to Graph Algorithms offers high-quality content in the research area of graph algorithms and explores the latest developments in graph algorithmics. The reader will gain a comprehensive understanding of how to use algorithms to explore graphs. It is a collection of texts that have proved to be trend setters and good examples of that. The book aims at providing the reader with a deep understanding of the structural properties of graphs that are useful for the design of efficient algorithms. These algorithms have applications in finite state machine modelling, social network theory, biology, and mathematics. The book contains many exercises, some up at present-day research-level. The exercises encourage the reader to discover new techniques by putting things in a clear perspective. A study of this book will provide the reader with many powerful tools to model and tackle problems in real-world scenarios.