Summer Reading B2G1 Free
 
 

Special Offers see all

Enter to WIN a $100 Credit

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

Visit our stores


    Recently Viewed clear list


    Original Essays | July 15, 2015

    Frank Wilczek: IMG You Are... Who?



    Writing a book is an unnatural act of communication. Speaking to a person, or even to an audience, is an interaction. Very different styles are... Continue »
    1. $20.97 Sale Hardcover add to wish list

    spacer
Qualifying orders ship free.
$118.50
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote Warehouse Mathematics- Combinatorics

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 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

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:
9783642091865
Author:
Jungnickel, Dieter
Publisher:
Springer
Subject:
Combinatorics
Subject:
Algorithms
Subject:
Complexity theory.
Subject:
Graph theory
Subject:
optimzation
Subject:
OPTIMIZATION
Subject:
Mathematics of Computing
Subject:
Mathematics of Computing <P>This is the third edition of the classic textbook on the subject, and it is even more relevant to students of, and researchers in, mathematics than ever before. With its clear writing, strong organization, and comprehensive cov
Subject:
Mathematics-Combinatorics
Copyright:
Edition Description:
Softcover reprint of hardcover 3rd ed. 2008
Series:
Algorithms and Computation in Mathematics
Series Volume:
5
Publication Date:
20101129
Binding:
TRADE PAPER
Language:
English
Pages:
670
Dimensions:
235 x 155 mm 999 gr

Related Subjects

Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Science and Mathematics » Electricity » General Electronics
Science and Mathematics » Mathematics » Combinatorics
Science and Mathematics » Mathematics » Computer
Science and Mathematics » Mathematics » Differential Equations

Algorithms and Computation in Mathematics #5: Graphs, Networks and Algorithms New Trade Paper
0 stars - 0 reviews
$118.50 In Stock
Product details 670 pages Not Avail - English 9783642091865 Reviews:
"Synopsis" by , 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" by , Revised throughout Includes new chapters on the network simplex algorithm and a section on the five color theorem Recent developments are discussed
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.