Graphs, Networks and Algorithms

Front Cover
Springer Science & Business Media, Aug 29, 2005 - Mathematics - 612 pages

From the reviews of the first edition:

".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..."

Mathematical Reviews 2002

This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced.

 

Contents

Preface to the Second Edition
1
Algorithms and Complexity
33
Shortest Paths
59
Spanning Trees 95
94
The Greedy Algorithm
123
Flows
147
Combinatorial Applications
201
Connectivity and Depth First Search
231
Weighted matchings
399
The TSP
433
A Some NPComplete Problems
475
B Solutions
483
List of Symbols
557
References 565
564
Index
597
Copyright

Colorings
253

Other editions - View all

Common terms and phrases

Bibliographic information