Catalogue : Reviews
Reviews
|
Günther Stiege Graphen und Graphalgorithmen ISBN: 978-3-8322-5113-0 Price: 24,80 € / 49,60 SFR |
|---|---|
|
Graphs are introduced from the start in full generality by allowing multiple edges and directed as well as undirected edges simultaneously. Paths, connectedness, depth-first search and breadth-first search, 2–connectedness, and partitions are covered in the elementary part of the text. In the second, non-elementary part one finds Menger´s theory, decomposition of a graph into components of higher connectivity, and algorithms to find such components. Reviewer: Herman J. Servatius (Worcester) |
|
| Source: Zentralblatt MATH | |
| go to details ... | |