Surprise Castle
Algorithmic Graph Theory

Algorithmic Graph Theory - Paperback

$68.99
Quantity
01

Pay over time for orders over $35.00 with

Availability:In StockContributor:Alan Gibbons, Alan Gibbons (Preface by)Publish date:1985-07-26Pages:272
Language:EnglishPublisher:Cambridge University PressISBN-13:9780521288811ISBN-10:521288819UPC:9780521288811Book Category:Mathematics, ComputersBook Subcategory:Graphic Methods, AppliedSize:9.08 x 6.10 x 0.69 inchesWeight:0.9304Product ID:SCXS6GZJ15
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.

Language:EnglishPublisher:Cambridge University PressISBN-13:9780521288811ISBN-10:521288819UPC:9780521288811Book Category:Mathematics, ComputersBook Subcategory:Graphic Methods, AppliedSize:9.08 x 6.10 x 0.69 inchesWeight:0.9304Product ID:SCXS6GZJ15
Publisher: Cambridge University Press

Free shipping on orders over $75. Standard shipping takes 3-7 business days. Returns accepted within 30 days of purchase.

Recently Viewed

View All