9780521288811

Algorithmic Graph Theory

Format: Paperback

ISBN13: 9780521288811

Paperback|9780521288811


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.

ISBN-13

9780521288811

ISBN-10

0521288819

Weight

0.97 Pounds

Dimensions

5.99 x 0.68 x 9.02 In

List Price

$58.99

Edition

1st Edition

Format

Paperback

Language

English

Pages

272 pages

Publisher

Cambridge University Press

Published On

1985-06-27



View All Offers

Sort by:

Condition
Seller
Seller Comments
Price
Used, Good
Seller details
SurplusTextSeller
★★★★★

Columbia, MO, USA

Ships in a BOX from Central Missouri! May not include working access code. Will not include dust j...
$46.79

 Free delivery by: 28 Mar 2026

Used, Good
Seller details
HPB-Red
★★★★★

Dallas, TX, USA

Connecting readers with great books since 1972! Used textbooks may not include companion materials s...
$46.99

 Free delivery by: 28 Mar 2026

Used, Good
Seller details
Bonita
★★★★☆

Santa Clarita, CA, USA

Access codes and supplements are not guaranteed with used items. May be an ex-library book.
$91.39

 Free delivery by: 28 Mar 2026


Bookstores.com relies on cookies to improve your experience.