A Guide to Graph Algorithms 1st ed. 2022 Edition

A Guide to Graph Algorithms 1st ed. 2022 Edition book cover

A Guide to Graph Algorithms 1st ed. 2022 Edition

Author(s): Ton Kloks (Author), Mingyu Xiao (Author)

  • Publisher: Springer
  • Publication Date: 23 Feb. 2022
  • Edition: 1st ed. 2022
  • Language: English
  • Print length: 355 pages
  • ISBN-10: 9811663491
  • ISBN-13: 9789811663499

Book Description

This book A Guide to Graph Algorithms 1st ed. 2022 Edition 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.

Editorial Reviews

Review

“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)

From the Back Cover

This book A Guide to Graph Algorithms 1st ed. 2022 Edition 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.

View on Amazon

未经允许不得转载:Wow! eBook » A Guide to Graph Algorithms 1st ed. 2022 Edition