Algorithmic Graph Theory

 

You are here: Sciences > Mathematics > Combinatorics & Graph The... 

Word Power Books

Algorithmic Graph Theory


by Alan Gibbons (Author)

 

Paperback

ISBN: 9780521288811

 

Availability: This is a print on demand item and it could take up to 6 weeks to be despatched.

 

Our Price: £31.99

RRP £31.99 , Save £0.00

 

0 customer(s) reviewed this product



  • Description
  • Reviews
  • Book Details
  • Contents

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


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.


 

ISBN 521288819
ISBN13 9780521288811
Publisher Cambridge University Press
Format Paperback
Publication date 27/06/1985
Pages 272
Weight (grammes) 400
Published in United Kingdom
Height (mm) 228
Width (mm) 152

Preface
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
Appendix
Author Index
Subject Index.