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.
0
SUMMARY OR ABSTRACT
Text of Note
There has been unprecedented growth in the study of graphs, which are discrete structures that have many real-world applications. The design and analysis of algebraic algorithms to solve graph problems have many advantages, such as implementing results from matrix algebra and using the already available matrix code for sequential and parallel processing. Providing Python programming language code for nearly all algorithms, this accessible textbook focuses on practical algebraic graph algorithms using results from matrix algebra rather than algebraic study of graphs. Given the vast theory behind the algebraic nature of graphs, the book strives for an accessible, middle-ground approach by reviewing main algebraic results that are useful in designing practical graph algorithms on the one hand, yet mostly using graph matrices to solve the graph problems. Python is selected for its simplicity, efficiency and rich library routines; and with the code herein, brevity is forsaken for clarity. Topics and features: Represents graphs by algebraic structures, enabling new, robust methods for algorithm analysis and design Provides matroid-based solutions to some graph problems, including greedy algorithm problems Offers Python code that can be tested and modified for various inputs Supplies practical hints, where possible, for parallel processing associated with algebraic algorithms Links to a web page with supportive materials This clearly arranged textbook will be highly suitable for upper-level undergraduate students of computer science, electrical and electronic engineering, bioinformatics, and any researcher or person with background in discrete mathematics, basic graph theory and algorithms. 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.
OTHER EDITION IN ANOTHER MEDIUM
Author
Erciyes, K.
Place of Publication
Cham : Springer International Publishing AG,c2021
Title
Algebraic Graph Algorithms
International Standard Book Number
9783030878856.
TOPICAL NAME USED AS SUBJECT
Entry Element
Graph algorithms.
Entry Element
Python (Computer program language)
(SUBJECT CATEGORY (Provisional
Subject Category Subdivision Code
COM051300
System Code
bisacsh
DEWEY DECIMAL CLASSIFICATION
Number
518/
.
1
Edition
23
LIBRARY OF CONGRESS CLASSIFICATION
Class number
QA166
.
245
Book number
.
E7
2021
PERSONAL NAME - PRIMARY RESPONSIBILITY
Entry Element
Erciyes, K.,
CORPORATE BODY NAME - SECONDARY RESPONSIBILITY
Entry Element
Ohio Library and Information Network.
ORIGINATING SOURCE
Agency
کتابخانه مرکزی و مرکز اطلاع رسانی دانشگاه
Date of Transaction
20231024040932.0
Cataloguing Rules (Descriptive Conventions))
rda
ELECTRONIC LOCATION AND ACCESS
Date and Hour of Consultation and Access
A Practical Guide Using Python-Springer (2022).pdf