 BROWSE
 USED
 STAFF PICKS
 GIFTS + GIFT CARDS
 SELL BOOKS
 BLOG
 EVENTS
 FIND A STORE
 800.878.7323

On Order
$118.50
New Hardcover
Currently out of stock.
available for shipping or prepaid pickup only
This title in other editionsOther titles in the Algorithms and Computation in Mathematics series:
Algorithms and Computation in Mathematics #5: Graphs, Networks and Algorithmsby Dieter Jungnickel
Synopses & ReviewsPublisher Comments:From the reviews of the previous editions ".... 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 wellchosen 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 selfcontained. ..." K.Engel, Mathematical Reviews 2002 The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and wellchosen applications. The proofs of important results and the representation of key algorithms in a Pascallike notation allow this book to be used in a highlevel undergraduate or lowlevel graduate course on graph theory, combinatorial optimization or computer science algorithms. The wellworked solutions to exercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons, Zentralblatt für Mathematik 1061, 2005 The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or more transparent.
Synopsis:This is the third edition of the classic textbook on the subject. With its clear writing, strong organization, and comprehensive coverage of essential theory it is like a personal guide through this important topic, and now has lots of extra material.
Synopsis:Revised throughout Includes new chapters on the network simplex algorithm and a section on the five color theorem Recent developments are discussed
Synopsis:From the reviews of the 2nd edition The substantial development effort of this text clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and wellchosen applications. The proofs of important results and the representation of key algorithms in a Pascallike notation allow this book to be used in a highlevel undergraduate or lowlevel graduate course on graph theory, combinatorial optimization or computer science algorithms. The wellworked solutions to exercises are a real bonus for self study by students. The book is highly recommended. Zentralblatt für Mathematik 2005 The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or more transparent.
Table of ContentsPrefaces. 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. Appendix A: Some NPComplete Problems. Appendix B: Solutions. Appendix C: List of Symbols. References. Index.
What Our Readers Are SayingBe the first to add a comment for a chance to win!Product Details
Other books you might likeRelated Subjects
Computers and Internet » Computers Reference » General


