TY  - BOOK
AU  - Gibbons,Alan
TI  - Algorithmic graph theory
SN  - 9780521288811
U1  - 511.5 22
PY  - 1994///]
CY  - Cambridge
PB  - The press Syndicate of the university of Cambridge, 
KW  - Graph theory
KW  - Data processing
N1  - Includes index
N2  - This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colorability, flows in networks, matchings, and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and their 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. Everyday 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."
ER  -