Algebraic Graph Algorithms

A Practical Guide Using Python
1. Auflage 2021
ISBN: 978-3-030-87885-6
Verlag: Springer International Publishing

Buch, Englisch, 221 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 365 g

Reihe: Undergraduate Topics in Computer Science

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.

Zielgruppe

Upper undergraduate

Autoren/Hrsg.

Erciyes, K.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik

Inhaltsverzeichnis

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.

Über Autor(innen)

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.