##
**Algorithmic graph theory.**
*(English)*
Zbl 0755.68056

Prentice-Hall International Editions. Englewood Cliffs, NJ: Prentice- Hall. viii, 327 p. (1990).

The book treats questions about graph algorithms and their applications in computer systems. The presentation is on a clear logical level so the algorithms can be understood without special knowledge of any particular programming languages or systems. The content is organized in ten chapters: 1. Introduction to graph theory; 2. Arithmetic techniques; 3. Shortest paths; 4. Trees and acyclic digraphs; 5. Depth-first search; 6. Connectivity and routing; 7. Graph coloring; 8. Covers, domination, independent sets, matchings, and factors; 9. Parallel algorithms; 10. Computational complexity. The bibliography contains over 100 titles. The book appropriate as a text for both undergraduate and graduate students in engineering, mathematics, and computer science, as well as for researchers in these fields.

Reviewer: V.D.Tonchev (Houghton)

### MSC:

68W10 | Parallel algorithms in computer science |

68R10 | Graph theory (including graph drawing) in computer science |

05C85 | Graph algorithms (graph-theoretic aspects) |