Algorithmic Graph Theory
Alan Gibbons
Cambridge University Press, 1985
74,25 €On orderDelivery: 2-3 weeks
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.
- ISBN-13
- 9780521288811
- ISBN-10
- 0521288819
- Publisher
- Cambridge University Press
- Year
- 1985
- Publication date
- 1985-06-27
- Pages
- 272
- Dimensions
- 153x230x10
- Weight
- 442