Master your Minecraft
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Tour our stores


    Recently Viewed clear list


    What I'm Giving | December 2, 2014

    Cary Elwes: IMG Cary Elwes: What I'm Giving



    At Powell's, we feel the holidays are the perfect time to share our love of books with those close to us. For this special blog series, we reached... Continue »

    spacer
Qualifying orders ship free.
$89.95
New Hardcover
Ships in 1 to 3 days
Add to Wishlist
Qty Store Section
1 Burnside Mathematics- Combinatorics

More copies of this ISBN

Algorithms and Computation in Mathematics #5: Graphs, Networks and Algorithms

by

Algorithms and Computation in Mathematics #5: Graphs, Networks and Algorithms Cover

 

Synopses & Reviews

Publisher 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 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. ..." 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 well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked 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 well-chosen applications.

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

Table of Contents

Prefaces.- 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 NP-Complete Problems.- Appendix B: Solutions.- Appendix C: List of Symbols.- References.- Index.

Product Details

ISBN:
9783642322778
Author:
Jungnickel, Dieter
Publisher:
Springer
Subject:
Combinatorics
Subject:
Algorithms
Subject:
Complexity theory.
Subject:
Graph theory
Subject:
OPTIMIZATION
Subject:
Mathematics of Computing
Subject:
Mathematics-Applied
Copyright:
Edition Description:
4th ed. 2013
Series:
Algorithms and Computation in Mathematics
Series Volume:
5
Publication Date:
20121228
Binding:
HARDCOVER
Language:
English
Pages:
695
Dimensions:
235 x 155 mm

Related Subjects

Computers and Internet » Computers Reference » General
Science and Mathematics » Geology » Earth Sciences
Science and Mathematics » Mathematics » Applied
Science and Mathematics » Mathematics » Combinatorics
Science and Mathematics » Physics

Algorithms and Computation in Mathematics #5: Graphs, Networks and Algorithms New Hardcover
0 stars - 0 reviews
$89.95 In Stock
Product details 695 pages Springer - English 9783642322778 Reviews:
"Synopsis" by , 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 well-chosen applications.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.