Algorithmic Graph Theory
by
Alan Gibbons
Book Details
Format
Paperback / Softback
ISBN-10
0521288819
ISBN-13
9780521288811
Publisher
Cambridge University Press
Imprint
Cambridge University Press
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Jun 27th, 1985
Print length
272 Pages
Weight
442 grams
Dimensions
15.30 x 23.00 x 1.00 cms
Product Classification:
Combinatorics & graph theoryInformation technology: general issues
Ksh 7,800.00
Manufactured on Demand
Delivery in 29 days
Delivery Location
Delivery fee: Select location
Delivery in 29 days
Secure
Quality
Fast
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.
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 their 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.
Get Algorithmic Graph Theory by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Cambridge University Press and it has pages.
