Algorithmic Graph Theory

Gibbons, Alan

ISBN 10: 0521246598 / ISBN 13: 9780521246590

Edité par Cambridge University Press, 1985

A propos de cet article

The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. N° de réf. du vendeur GOR008059551

Détails bibliographiques

Titre : Algorithmic Graph Theory

Éditeur : Cambridge University Press

Date d'édition : 1985

Reliure : Hardback

Etat : Very Good

A propos de ce titre

Synopsis :

An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.

Présentation de l'éditeur:

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.