Algorithmic graph theory. Deterministic and randomized algorithms (Q6587249)

The book is written in German and directed towards not yet scientifically working students in order to make them acquainted with all types of graphs, of problems solved via graph algorithms, and the many concepts and definitions around all that. As already in its first edition, the book seems to meet these requirements very well. A lot of literature is presented and a sufficient index. Some reluctance in showing mathematics beyond verbal communication of principles may be observed.\N\NAlgorithms are broken down to tiny pieces. Programs, when necessary, are shown in a fairly simple notation, mostly limited in length to one third or one half of a page.\N\NThe graph illustrations look nice and are easily comprehensible. Every chapter heading is preceded by a carefully chosen -- and also explained -- picture of a somehow interesting graph. Complexity argumentation appears only in smaller portions. In contrast, a multitude of exercises are included; their solutions are announced to be accessible via the publisher's website on the Internet.\N\NSee also the review of the first edition in [Zbl 0843.68084]. For the second, third and fourth editions see [Zbl 1205.68269; Zbl 1213.68471; Zbl 1326.68004].