Skip to content
ISBN: 0521288819
ISBN13: 9780521288811

Algorithmic Graph Theory

$68.68List Price: $66.00
ISBN: 0521288819
ISBN13: 9780521288811
Formats

Conditions

A brand-new, unused copy in perfect condition.

Formats

Conditions

A brand-new, unused copy in perfect condition.

See all 3 editionsfrom $68.68

Book Overview

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.
Format:
Paperback
Language:
English
ISBN:
0521288819
ISBN13:
9780521288811
Release Date:
July 1985
Publisher:
Cambridge University Press
Length:
272 Pages
Weight:
0.92 lbs.
Dimensions:
0.7″ × 6.1″ × 9.1″
AlgorithmsComputer ScienceComputersComputers & TechnologyEducation & ReferenceGraph TheoryGraphic DesignMathMathematicsProgramming

More by Alan Gibbons

Customer Reviews

0 customer ratings | 0 reviews
Write a Review

There are currently no reviews. Be the first to review this work.