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

More copies of this ISBNThis 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
Synopsis:With updated material, additional exercises and new references, the new edition of this book retains the attributes praised by reviewers: its clear writing, good organisation, comprehensive coverage of essential theory and wellchosen applications.
About the AuthorDieter 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 wellknown books, including "Optimization Methods", "Finite Fields", "Coding Theory" and "Graphs, Networks and Algorithms", some of which have
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
Related Subjects
Computers and Internet » Computers Reference » General


