Graphs, Networks and Algorithms

Graphs, Networks and Algorithms

by Dieter Jungnickel

Paperback(4th ed. 2013)

View All Available Formats & Editions
Choose Expedited Shipping at checkout for guaranteed delivery by Wednesday, February 26
3 New & Used Starting at $83.48


Combinatorial optimization, along with graph algorithms and complexity theory, is a thriving topic among researchers. This well-written book includes a thorough treatment of algorithms and a presentation of the most prominent problems in the subject, among them the "traveling salesman problem." It contains enlightening exercises with clear hints, and an impressive list of references which provides guidance for further reading.

Product Details

ISBN-13: 9783642436642
Publisher: Springer Berlin Heidelberg
Publication date: 12/13/2014
Series: Algorithms and Computation in Mathematics , #5
Edition description: 4th ed. 2013
Pages: 676
Product dimensions: 6.10(w) x 9.25(h) x (d)

About the Author

Dieter Jungnickel is an internationally known mathematician working in the field of applied algebra, coding theory, design theory, finite geometry, codes and designs and combinatorial optimization.

He has published several well-known books, including “Optimization Methods”, “Finite Fields”, “Coding Theory” and “Graphs, Networks and Algorithms”, some of which have been published both in English and German.

Table of Contents

Basic Graph Theory.- Algorithms and Complexity.- Shortest Paths.- Spanning Trees.- The Greedy Algorithm.- Flows.- Combinatorial Applications.- Connectivity and Depth First Search.- Colorings.- Circulations.- The Network Simplex Algorithm.- Synthesis of Networks.- Matchings.- Weighted matchings.- A Hard Problem: The TSP.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews