Algorithmic Graph Theory

Gibbons, Alan:

ISBN 10: 0521288819 / ISBN 13: 9780521288811

Edité par Cambridge University Press, 1985

A propos de cet article

272 Seiten Cambridge University Press 1988 : Alan Gibbons - Perfect tb - Namenseitrag - 9-81-4-L1 N9-IYL3-2BD3 Sprache: Englisch Gewicht in Gramm: 476. N° de réf. du vendeur 137895

Détails bibliographiques

Titre : Algorithmic Graph Theory

Éditeur : Cambridge University Press

Date d'édition : 1985

Reliure : Taschenbuch

Etat : Gut

A propos de ce titre

Synopsis :

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.