Algebraic graph algorithms. A practical guide using Python

DOI10.1007/978-3-030-87886-3MaRDI QIDQ2240967zbMATH OpenOpenAlexFDO

Publication date 4 November 2021

Published in Undergraduate Topics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-87886-3

graph algorithms matrix computations Python

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Software, source code, etc. for problems pertaining to combinatorics (05-04) Graph algorithms (graph-theoretic aspects) (05C85)

Review text

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. The book is divided into two parts. The list of the sections of the first part of the book consists of a Short review of Python; Basics matrix computations; Graphs, matrices, and matroids; Parallel and sparse matrix computations. This part of the book can make up the content of the lecture part of the course. The second part of the book ``Graph algorithms consists of the following sections: Trees; Shortest paths; Connectivity and matching; Subgraph search; Large graph analysis; Graph partitioning and clustering. In the reviewer's opinion, this part of the book can make up the content a practical part of the course ``Algorithms on graphs and networks. The practical part can be implemented not only in Python.

Recommendations

Cited in

(1)

Algorithms on Trees and Graphs

Describes a project that uses

Uses Software

Python

This page was built for publication: Algebraic graph algorithms. A practical guide using Python

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2240967)