"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, colour...

Full description

Bibliographic Details

Main Author:	Gibbons, Alan (Author)
Format:	Book
Language:	English
Published:	Cambridge [u.a.] Cambridge Univ. Press 1985
Edition:	1. publ.
Subjects:	Grafentheorie Graphes, Théorie des Graphes, Théorie des - Informatique Datenverarbeitung Graph theory Graph theory > Data processing Algorithmus Graphentheorie
Summary:	"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."-- Book cover.
Item Description:	Hier auch später erschienene, unveränderte Nachdrucke
Physical Description:	XII, 259 S. graph. Darst.
ISBN:	0521246598 0521288819