Algebraic graph algorithms : a practical guide using Python / K. Erciyes.
2021
QA166.245
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Algebraic graph algorithms : a practical guide using Python / K. Erciyes.
Author
Erciyes, K., author.
ISBN
9783030878863 (electronic bk.)
3030878864 (electronic bk.)
3030878856
9783030878856
3030878864 (electronic bk.)
3030878856
9783030878856
Imprint
Cham, Switzerland : Springer, 2021.
Language
English
Description
1 online resource (229 pages)
Other Standard Identifiers
10.1007/978-3-030-87886-3 doi
Call Number
QA166.245
Dewey Decimal Classification
518/.1
Summary
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.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Digital File Characteristics
text file
PDF
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed December 6, 2021).
Series
Undergraduate topics in computer science.
Available in Other Form
Algebraic Graph Algorithms.
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
Table of Contents
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.
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.