Ebook: Graphs, Networks and Algorithms

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.

---

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.

Content:
Front Matter....Pages I-XVI
Basic Graph Theory....Pages 1-31
Algorithms and Complexity....Pages 33-58
Shortest Paths....Pages 59-93
Spanning Trees....Pages 95-122
The Greedy Algorithm....Pages 123-146
Flows....Pages 147-200
Combinatorial Applications....Pages 201-229
Connectivity and Depth First Search....Pages 231-252
Colorings....Pages 253-269
Circulations....Pages 271-320
The Network Simplex Algorithm....Pages 321-339
Synthesis of Networks....Pages 341-365
Matchings....Pages 367-397
Weighted matchings....Pages 399-432
A Hard Problem: The TSP....Pages 433-474
Back Matter....Pages 475-611

---

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.

Content:
Front Matter....Pages I-XVI
Basic Graph Theory....Pages 1-31
Algorithms and Complexity....Pages 33-58
Shortest Paths....Pages 59-93
Spanning Trees....Pages 95-122
The Greedy Algorithm....Pages 123-146
Flows....Pages 147-200
Combinatorial Applications....Pages 201-229
Connectivity and Depth First Search....Pages 231-252
Colorings....Pages 253-269
Circulations....Pages 271-320
The Network Simplex Algorithm....Pages 321-339
Synthesis of Networks....Pages 341-365
Matchings....Pages 367-397
Weighted matchings....Pages 399-432
A Hard Problem: The TSP....Pages 433-474
Back Matter....Pages 475-611
....