Graphs, Networks and Algorithms: 5 (Algorithms and Computation in Mathematics, 5) - Image 1

£71.52

Springer Graphs, Networks and Algorithms: 5 (Algorithms and Computation in Mathematics, 5)

Name: Graphs, Networks and Algorithms: 5 (Algorithms and Computation in Mathematics, 5)
Brand: Springer
Price: 71.52 GBP
Availability: InStock

Computer Science

About as cheap as it gets. The only time it was cheaper was 3 months ago.

£72 today · all-time low £70 (Apr 2026) · usually £73

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 71 days · 71 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 71 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £73 (40 days, 56.3%)

Price range: £70 - £73

Price levels: 3 different prices over 71 days

Description

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 2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises – as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have beenadded.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3642322778
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 09 November 2012
Listed Since: 11 August 2012

Barcode

No barcode data available

Springer Graphs, Networks and Algorithms: 5 (Algorithms and Computation in Mathematics, 5)

About as cheap as it gets. The only time it was cheaper was 3 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms: 34 (Chapman & Hall/CRC Computer and Information Science Series)

Graph and Network Theory: An Applied Approach using Mathematica®: 193 (Springer Optimization and Its Applications, 193)

Graph Theory and Its Applications (Textbooks in Mathematics)

LMS: 241 Surveys Combinatorics, 97 (London Mathematical Society Lecture Note Series, Series Number 241)

Introduction to Combinatorial Optimization: 196 (Springer Optimization and Its Applications, 196)

Coloring Mixed Hypergraphs: Theory, Algorithms and Applications (Fields Institute Monographs)

Topics in Algorithmic Graph Theory: 178 (Encyclopedia of Mathematics and its Applications, Series Number 178)

Applications of Combinatorics and Graph Theory to the Biological and Social Sciences: 17 (The IMA Volumes in Mathematics and its Applications, 17)

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems

Combinatorics with Emphasis on the Theory of Graphs: 54 (Graduate Texts in Mathematics, 54)

50 years of Combinatorics, Graph Theory, and Computing (Discrete Mathematics and Its Applications)

Graph Theory: 173 (Graduate Texts in Mathematics, 173)

Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022, Proceedings: 13270 (Lecture Notes in Computer Science, 13270)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Guide to Graph Algorithms: Sequential, Parallel and Distributed (Texts in Computer Science)

New Perspectives in Algebraic Combinatorics: 38 (Mathematical Sciences Research Institute Publications, Series Number 38)

Handbook of Product Graphs, Second Edition (Discrete Mathematics and Its Applications)

Combinatorial Algorithms: 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings: 13889 (Lecture Notes in Computer Science, 13889)

Combinatorial Methods with Computer Applications: Discrete Mathematics and Its Applications