Language: English
Published by Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: Literary Cat Books, Machynlleth, Powys, WALES, United Kingdom
Association Member: IOBA
First Edition
Original decorated wrappers. Condition: Very Good. First Paperback Edition. With diagrams. Former owner's name on front free endpaper. Pages yellowed as normal for age. Spine uncreased. Slight wear to spine, covers & corners. ; Large 8vo 9" - 10" tall; xii, 259 pages.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: Antiquariat Armebooks, Frankfurt am Main, Germany
Taschenbuch. Condition: Gut. 272 Seiten Cambridge University Press 1988 : Alan Gibbons - Perfect tb - Namenseitrag - 9-81-4-L1 N9-IYL3-2BD3 Sprache: Englisch Gewicht in Gramm: 476.
Language: English
Published by Cambridge University Press CUP, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 272 Indices.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 272 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press 1985-06-27, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 47.31
Quantity: Over 20 available
Add to basketCondition: New. In.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. pp. 272.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: BennettBooksLtd, Los Angeles, CA, U.S.A.
paperback. Condition: New. In shrink wrap. Looks like an interesting title!
Published by Cambridge University Press, Cambridge, 1985
Seller: J. Wyatt Books, Ottawa, ON, Canada
Soft cover. Condition: Very Good. 259 pages in very good condition. Pages are clean and unmarked. Page edges are lightly darkened. Black card covers with white and green titles. Lightly worn around the edges. Spine is lightly scratched. VG/- -. Book.
Seller: Tommaso D'antrassi DI, Bologna, BO, Italy
Condition: Good. Buone condizioni, leggeri segni di usura.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. 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.
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 271 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
£ 48.76
Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Language: English
Published by Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. 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. An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Language: English
Published by Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: CitiRetail, Stevenage, United Kingdom
Paperback. Condition: new. Paperback. 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. An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 o.
Language: English
Published by Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: AussieBookSeller, Truganina, VIC, Australia
Paperback. Condition: new. Paperback. 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. An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Language: English
Published by Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Algorithmic Graph Theory | Alan Gibbons | Taschenbuch | Kartoniert / Broschiert | Englisch | 1985 | Cambridge University Press | EAN 9780521288811 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.