£42.89

Cambridge University Press Algorithmic Graph Theory

Name: Algorithmic Graph Theory
Brand: Cambridge University Press
Price: 39.56 GBP
Availability: InStock

Black

Algorithms

Price History & Forecast

Last 91 days • 91 data points

Historical

Generating forecast...

Price Distribution

Price distribution over 91 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £40 (84 days, 92.3%)

Price range: £40 - £43

Price levels: 2 different prices over 91 days

Description

This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text.

Product Specifications

Brand: Cambridge University Press
Colour: Black
Format: paperback
ASIN: 0521288819
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 27 June 1985
Listed Since: 12 February 2007

Barcode

No barcode data available

Cambridge University Press Algorithmic Graph Theory

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Elementary Number Theory, Group Theory and Ramanujan Graphs: 55 (London Mathematical Society Student Texts, Series Number 55)

Large-scale Graph Analysis: System, Algorithm and Optimization (Big Data Management)

An Introduction to String Diagrams for Computer Scientists (Elements in Applied Category Theory)

Introduction to Algebraic Geometry

Groups, Graphs and Trees: An Introduction to the Geometry of Infinite Groups (London Mathematical Society Student Texts, Series Number 73)

Open Problems in Mathematics and Computational Science

Topics in Graph Theory: Graphs and Their Cartesian Product

A Guide to Experimental Algorithmics

General Topology for Beginners

Illustrating Pascal

The Mathematics of Logic: A Guide to Completeness Theorems and their Applications

Finite Geometry and Combinatorial Applications: 82 (London Mathematical Society Student Texts, Series Number 82)

Introduction to Finite Fields and their Applications

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

Topology for Computing: 16 (Cambridge Monographs on Applied and Computational Mathematics, Series Number 16)

Matroid Applications: 40 (Encyclopedia of Mathematics and its Applications, Series Number 40)

Phylogenetic Networks: Concepts, Algorithms and Applications

Jewels Of Stringology: Text Algorithms

Approximation Algorithms for Traveling Salesman Problems

The Theory of Finite Linear Spaces: Combinatorics of Points and Lines

A Second Course on Real Functions

Bandit Algorithms

Combinatorial Complexes: A Mathematical Theory of Algorithms: 2 (Mathematics and Its Applications, 2)

Sparsity: Graphs, Structures, and Algorithms: 28 (Algorithms and Combinatorics, 28)