Header

Reviews

Reviews
978-3-8322-5113-0
Günther Stiege
Graphen und Graphalgorithmen
Informatik
Review
Zentralblatt MATH, 17.06.2010

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)

Shaker Verlag GmbH
Am Langen Graben 15a
52353 Düren
Germany
  +49 2421 99011 9
Mon. - Thurs. 8:00 a.m. to 4:00 p.m.
Fri. 8:00 a.m. to 3:00 p.m.
Contact us. We will be happy to help you.
Captcha
Social Media