ENGLISH

Algorithmic graph theory

By Alan M. Gibbons

Book information

Publisher
Cambridge University Press
Year
1985
ISBN
0521246598, 9780521246590
LCC
QA166 .G53 1985
Open Library ID
OL2861030M
Language
english
Format
DJVU
Filesize
3 MB (3400169 bytes)
Edition
1
Pages
267\267
DPI
600
Orientation
no
Scanned
yes
Time added
2012-03-09 12:00:00

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.

Similar books