K. Erciyes

Algebraic Graph Algorithms

A Practical Guide Using Python

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Undergraduate Topics in Computer Science
• Verlag: Springer / Springer International Publishing / Springer, Berlin
• Artikelnr. des Verlages: 978-3-030-87885-6
• 1st ed. 2021
• Seitenzahl: 236
• Erscheinungstermin: 18. November 2021
• Englisch
• Abmessung: 235mm x 155mm x 13mm
• Gewicht: 365g
• ISBN-13: 9783030878856
• ISBN-10: 3030878856
• Artikelnr.: 62471053

Autorenporträt

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.

Inhaltsangabe

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.

Rezensionen

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