Algorithmic Graph Theory |
|
| Author:
| Gibbons, Alan |
| ISBN: | 978-0-521-28881-1 |
| Publication Date: | Jun 1985 |
| Publisher: | Cambridge University Press
|
| Book Format: | Paperback |
| List Price: | USD $58.99 |
Book Description:
|
Algorithm Graph Theory introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matching and transversals) and covers many of the classical theorems. Its emphasis is on algorithms and their complexity ñ which graph problems have known efficient solutions and which are intractable.
Algorithm Graph Theory introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matching and transversals) and covers many of the classical theorems. Its emphasis is on algorithms and their complexity ñ which graph problems have known efficient solutions and which are intractable.