Algebraic Graph Algorithms
A Practical Guide Using Python
Published on 17. November 2021
XIII, 221 pages
978-3-030-87886-3 (ISBN)
Description
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.
Reviews / Votes
"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)More details
Series
Edition
1st ed. 2021
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Product notice
Reflowable
Illustrations
XIII, 221 p. 100 illus., 12 illus. in color.
File size
3,25 MB
ISBN-13
978-3-030-87886-3 (9783030878863)
DOI
10.1007/978-3-030-87886-3
Schweitzer Classification
Other editions
Additional editions
Book
11/2021
Springer
€42.79
Shipment within 7-9 days
Person
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
.
Content
1. Introduction.- 2. Graphs, Matrices and Matroids.- 3. Parallel Matrix Algorithm Kernel.- 4. Basic Graph Algorithms.- 5. Connectivity, Matching and Matroids.- 6. Subgraph Search.- 7. Analysis of Large Graphs.- 8. Clustering in Complex Networks.- 9. Kronecker Graphs.- 10. Sample Algorithms for Complex Networks.
