Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : WorldofBooks, Goring-By-Sea, WS, Royaume-Uni
EUR 6,36
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Good. The book has been read but remains in clean condition. All pages are intact and the cover is intact. Some minor wear to the spine.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
EUR 7,18
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 0.92.
Edité par Cambridge University Press, 1994
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Anybook.com, Lincoln, Royaume-Uni
EUR 6,11
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:9780521288811.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521246598 ISBN 13 : 9780521246590
Langue: anglais
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
EUR 11,04
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
EUR 8,66
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
EUR 8,66
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521246598 ISBN 13 : 9780521246590
Langue: anglais
Vendeur : WorldofBooks, Goring-By-Sea, WS, Royaume-Uni
EUR 12,52
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardback. Etat : Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521246598 ISBN 13 : 9780521246590
Langue: anglais
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
EUR 14,49
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.15.
Edité par Cambridge, Cambridge University Press, 1988
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Antiquariat Smock, Freiburg, Allemagne
EUR 24
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Gut. Formateinband: Broschierte Ausgabe XII, 259 S. (23 cm) Reprinted; Gut und sauber erhalten. Sprache: Englisch Gewicht in Gramm: 550 [Stichwörter: Algorithmische Graphentheorie; Spanning-trees, branchings and connectivity; Planar graphs; Networks and flows; Matchings; Eulerian and Hamiltonian tours; Colouring graphs; Graph problems and intractability].
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Antiquariat Armebooks, Frankfurt am Main, Allemagne
EUR 25,21
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 59,56
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Edité par Cambridge University Press CUP, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 57,61
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 272 Indices.
Edité par Cambridge University Press 1985-06-27, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Chiron Media, Wallingford, Royaume-Uni
EUR 55,81
Autre deviseQuantité disponible : 10 disponible(s)
Ajouter au panierPaperback. Etat : New.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 56,61
Autre deviseQuantité disponible : 3 disponible(s)
Ajouter au panierEtat : New. pp. 272 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 59,58
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 272.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Goodwill Books, Hillsboro, OR, Etats-Unis
EUR 4,51
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 68,51
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Toscana Books, AUSTIN, TX, Etats-Unis
EUR 55,12
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 79,22
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
Edité par Cambridge University Press, Cambridge, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : CitiRetail, Stevenage, Royaume-Uni
EUR 64,13
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : HPB-Red, Dallas, TX, Etats-Unis
EUR 4,51
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : BennettBooksLtd, North Las Vegas, NV, Etats-Unis
EUR 74,25
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierpaperback. Etat : New. In shrink wrap. Looks like an interesting title!
Edité par Cambridge University Press, Cambridge, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : AussieBookSeller, Truganina, VIC, Australie
EUR 82,32
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : HPB Inc., Dallas, TX, Etats-Unis
EUR 27,93
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierpaperback. Etat : Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority!
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 60,52
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Cambridge University Press, Cambridge, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : Grand Eagle Retail, Fairfield, OH, Etats-Unis
EUR 73,98
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Edité par Cambridge University Press, Cambridge, 1985
Vendeur : J. Wyatt Books, Ottawa, ON, Canada
EUR 36,28
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierSoft cover. Etat : 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.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 58,20
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierPaperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 430.
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 57,28
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 271 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand.
Edité par Cambridge University Press, 1985
ISBN 10 : 0521288819 ISBN 13 : 9780521288811
Langue: anglais
Vendeur : moluna, Greven, Allemagne
EUR 61,02
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : 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.