Paperback. Very Good. ISBN 0521288819 9780521288811 [GB]

ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press] Softcover Algorithmic Graph Theory This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. .
[Wallingford, United Kingdom] [Publication Year: 1985]

Cambridge University Press, Date: 1985-07-26. 1. paperback. Used: Good. 1985. Cambridge University Press ISBN 0521288819 9780521288811 [US]

Cambridge Univ Pr, Date: 1985. Paperback. New. 271 pages. 9.25x6.25x0.75 inches. 1985. Cambridge Univ Pr ISBN 0521288819 9780521288811 [GB]

Paperback / softback. New. 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 n which graph problems have known efficient solutions and which are intractable. ISBN 0521288819 9780521288811 [GB]

Cambridge University Press CUP , pp. 272 Indices. Papeback. New. Cambridge University Press CUP ISBN 0521288819 9780521288811 [US]

Cambridge Univ Pr 1985 Softcover New 271 pages. 9.25x6.25x0.75 inches.

ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press] Softcover Druck auf Anfrage Neuware - Printed after ordering - 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.
[Einbeck, Germany] [Publication Year: 1985]
Show/Hide image

Cambridge University Press, Date: 1985-07-26. Paperback. New. New. In shrink wrap. Looks like an interesting title! 1985. Cambridge University Press ISBN 0521288819 9780521288811 [US]