A Guide to Graph Algorithms (PDF)

Name: A Guide to Graph Algorithms
Brand: Springer Nature Singapore
SKU: 142174831
Price: 58.84 EUR
Availability: OnlineOnly

(Sprache: Englisch)

Autoren: Ton Kloks , Mingyu Xiao

Schreiben Sie einen Kommentar zu "A Guide to Graph Algorithms".

A Guide to Graph Algorithms, Ton Kloks, Mingyu Xiao

Merken

Mehr zum Inhalt Autorenporträt Video

eBook (pdf) 58.84 €

Buch (Kartoniert) 58.84 €

sofort als Download lieferbar

Bestellnummer: 142174831

eBook (pdf) 58.84 €

Download bestellen

Verschenken

29 DeutschlandCard Punkte sammeln

Lastschrift, Kreditkarte, Paypal, Rechnung
Kostenloser tolino webreader

Produktdetails

Produktbeschreibung
Autorenporträt
eBook Hilfe
Biblio. Angaben / Produktdetails

Produktinformationen zu „A Guide to Graph Algorithms (PDF)“

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.

Autoren-Porträt von Ton Kloks, Mingyu Xiao

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.