DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
The beginning of knowledge is the discovery of something we do not understand.
ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press] Softcover This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,450grams, ISBN:9780521288811 [Lincoln, United Kingdom] [Publication Year: 1987]
ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press] Softcover The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. [Goring-By-Sea, WS, United Kingdom] [Publication Year: 1985]
Cambridge University Press, Date: 1987. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,450grams, ISBN:9780521288811 1987. Cambridge University Press ISBN 0521288819 9780521288811 [GB]
ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press] Softcover This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,450grams, ISBN:9780521288811 [Lincoln, United Kingdom] [Publication Year: 1987]
ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press] Softcover The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. [Goring-By-Sea, WS, United Kingdom] [Publication Year: 1985]
ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: - -] Softcover 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. [Reading, United Kingdom] [Publication Year: 1985]
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]
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 1987 Trade paperback This is an ex-library book and may have the usual library/used-book markings inside. This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 450grams, ISBN: 9780521288811.
ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press] Softcover New. Fast Shipping and good customer service [Fayetteville, TX, U.S.A.] [Publication Year: 1985]
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]
ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press CUP] Softcover pp. 272 Indices [New York, NY, U.S.A.] [Publication Year: 1985]
ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press] Softcover pp. 272 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam [Hounslow, United Kingdom] [Publication Year: 1985]
ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press] Softcover Buy with confidence! Book is in new, never-used condition [Amherst, NY, U.S.A.] [Publication Year: 1985]
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]
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]
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]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
