ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press, United Kingdom, Cambridge] Softcover 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 thier 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. 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: Cambridge University Press 1985-06-27] Softcover
[Wallingford, United Kingdom] [Publication Year: 1985]

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

ISBN10: 0521288819, ISBN13: 9780521288811, [publisher: Cambridge University Press CUP] Softcover pp. 272 Indices
[New York, NY, U.S.A.] [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]

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