This item is not eligible for Amazon Prime, but millions of other items are. Join Amazon Prime today. Already a member? Sign in.

11 used & new from £33.00
See All Buying Options
Have one to sell? Sell yours here
 
   
Tell a Friend
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
 
 
Share your own customer images
Search inside this book

Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics) (Hardcover)

by Dieter Jungnickel (Author) "A graph G is a pair G = (V, E) consisting of a finite set V 0 and a set E of two-element subsets of..." (more)
5.0 out of 5 stars  (1 customer review)

Available from these sellers.


11 used & new available from £33.00
Other Editions: RRP: Our Price: Other Offers:
Hardcover (3Rev Ed) £50.00 £47.50 34 used & new from £41.50
 
   

Customers Who Bought This Item Also Bought

Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications by Mark De Berg

4.5 out of 5 stars (2)  £25.65
Schaum's Outline of Graph Theory: Including Hundreds of Solved Problems (Schaum's Outline Series)

Schaum's Outline of Graph Theory: Including Hundreds of Solved Problems (Schaum's Outline Series) by V. K. Balakrishnan

3.5 out of 5 stars (2)  £9.49
The Mathematics of Financial Derivatives: A Student Introduction

The Mathematics of Financial Derivatives: A Student Introduction by Jeff Dewynne

5.0 out of 5 stars (2)  £27.54
A First Course in Abstract Algebra (International Edition)

A First Course in Abstract Algebra (International Edition) by John B. Fraleigh

4.0 out of 5 stars (2)  £44.64
Complex Analysis

Complex Analysis by Ian Stewart

4.8 out of 5 stars (5)  £28.49
› Explore similar items : Books (7)

Product details

  • Hardcover: 611 pages
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. K; 2Rev Ed edition (20 Oct 2004)
  • Language English
  • ISBN-10: 3540219056
  • ISBN-13: 978-3540219057
  • Product Dimensions: 23.8 x 16.2 x 4 cm
  • Average Customer Review: 5.0 out of 5 stars See all reviews (1 customer review)
  • Amazon.co.uk Sales Rank: 992,073 in Books (See Bestsellers in Books)

    Popular in this category:

    #21 in  Books > Computing & Internet > Computer Science > Algorithms > Network Algorithms

    (Publishers and authors: Improve Your Sales)
  • Other Editions: Hardcover (3Rev Ed) |  All Editions

    •  Would you like to update product info or give feedback on images?

Customers Viewing This Page May Be Interested in These Sponsored Links

 (What is this?)
Network Tools
www.Paessler.com    Server, LAN & WAN Monitoring. Easy to use. 100% free trial. 

Product Description

Synopsis
From the reviews of the first edition:"...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..." Mathematical Reviews 2002This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced.
Inside This Book (Learn More)
First Sentence
A graph G is a pair G = (V, E) consisting of a finite set V 0 and a set E of two-element subsets of V. Read the first page
Explore More
Concordance
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book: