Overview
- Represents graphs by algebraic structures, enabling new, robust methods for algorithm analysis and design
- Provides matroid-based solutions to graph problems, including greedy algorithm problems
- Discusses algebraic graph algorithms for complex networks, showing parallel implementations
Part of the book series: Undergraduate Topics in Computer Science (UTICS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
This textbook discusses the design and implementation of basic algebraic graph algorithms, and algebraic graph algorithms for complex networks, employing matroids whenever possible. The text describes the design of a simple parallel matrix algorithm kernel that can be used for parallel processing of algebraic graph algorithms. Example code is presented in pseudocode, together with case studies in Python and MPI. The text assumes readers have a background in graph theory and/or graph algorithms.
Similar content being viewed by others
Keywords
Table of contents (11 chapters)
-
Front Matter
-
Graph Algorithms
-
Front Matter
-
-
Back Matter
Reviews
“The master’s course ‘Algorithms on graphs and networks’ has become almost mandatory at most universities in the computer science department. The refereed manual may be the basis of such a course, including both lectures and practical training.” (I. M. Erusalimskiy, zbMATH 1487.05001, 2022)
Authors and Affiliations
About the author
Dr. Kayhan Erciyes is a full Professor in the Department of Software Engineering at Maltepe University, Istanbul, Turkey. His other publications include the Springer titles Discrete Mathematics and Graph Theory, Distributed Real-Time Systems, Guide to Graph Algorithms, Distributed and Sequential Algorithms for Bioinformatics, and Distributed Graph Algorithms for Computer Networks.
Bibliographic Information
Book Title: Algebraic Graph Algorithms
Book Subtitle: A Practical Guide Using Python
Authors: K. Erciyes
Series Title: Undergraduate Topics in Computer Science
DOI: https://doi.org/10.1007/978-3-030-87886-3
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2021
Softcover ISBN: 978-3-030-87885-6Published: 18 November 2021
eBook ISBN: 978-3-030-87886-3Published: 17 November 2021
Series ISSN: 1863-7310
Series E-ISSN: 2197-1781
Edition Number: 1
Number of Pages: XIII, 221
Number of Illustrations: 88 b/w illustrations, 12 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Mathematical Applications in Computer Science