Skip to main content
SpringerLink
Log in

A Guide to Graph Algorithms

  • Textbook
  • © 2022

Overview

Authors:
  1. Ton Kloks

    1. Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Mingyu Xiao

    1. Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Discusses in depth the treewidth and graph algorithms
  • Equips readers to handle complex NP-complete problems
  • Treats both theoretical and practical aspects of algorithms

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (4 chapters)

  1. Front Matter

    Pages I-XV
    Download chapter PDF

  2. Graphs

    • Ton Kloks, Mingyu Xiao
    Pages 1-15

  3. Algorithms

    • Ton Kloks, Mingyu Xiao
    Pages 17-124

  4. Problem Formulations

    • Ton Kloks, Mingyu Xiao
    Pages 125-128

  5. Recent Trends

    • Ton Kloks, Mingyu Xiao
    Pages 129-325

  6. Back Matter

    Pages 327-340
    Download chapter PDF
Back to top

Keywords

About this book

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.


Reviews

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

Authors and Affiliations

  • Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China

    Ton Kloks, Mingyu Xiao

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

Publish with us

Policies and ethics

Back to top

Search

Navigation