عنوان

Algorithmic graph theory /

(Number (ISBN

0521246598

(Number (ISBN

0521288819 (pbk.)

(Number (ISBN

9780521246590

(Number (ISBN

9780521288811 (pbk.)

Number

b528336

Title Proper

Algorithmic graph theory /

General Material Designation

[Book]

First Statement of Responsibility

Alan Gibbons.

Place of Publication, Distribution, etc.

New York :

Name of Publisher, Distributor, etc.

Cambridge University Press,

Date of Publication, Distribution, etc.

1985.

Specific Material Designation and Extent of Item

xii, 259 p. :

Other Physical Details

diagrs. ;

Dimensions

24 cm.

Text of Note

Includes bibliographical references and indexes.

Text of Note

1. Introducing graphs and algorithmic complexity -- 2. Spanning-trees, branchings and connectivity -- 3. Planar graphs -- 4. Networks and flows -- 5. Matchings -- 6. Eulerian and Hamiltonian tours -- 7. Colouring graphs -- 8. Graph problems and intractability.

1

Text of Note

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

Graph theory-- Data processing.

Graph theory.

Class number

Book number

Gibbons, Alan, (Alan M.)

Date of Transaction

20140203034732.0

Electronic name

[Book]

Y