Data structures and algorithms 2: Graph algorithms and NP-completeness. Transl. from the German. (English) Zbl 0556.68002

Mehlhorn, Kurt

EATCS. Monographs on Theoretical Computer Science, 2. Berlin etc.: Springer-Verlag. XII, 260 p. DM 48.00 (1984).

This is the second volume of the three volume monograph on data structures and algorithms. It covers algorithms on graphs, path problems in graphs and matrix multiplication, as well as NP-completeness. Most of the material can also be found in other textbooks on algorithms, combinatorial optimization, and flows in networks.

Reviewer: P.Brucker

MSC:

68-02	Research exposition (monographs, survey articles) pertaining to computer science
68W99	Algorithms in computer science
68Q25	Analysis of algorithms and problem complexity
68R10	Graph theory (including graph drawing) in computer science

Keywords:

graph algorithms; shortest path; spanning tree; network flows; matching; dynamic programming; branch and bound; depth first search; path problems; matrix multiplication; NP-completeness

Citations:

Zbl 0357.68041; Zbl 0556.68001; Zbl 0556.68003