Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: ThriftBooks-Dallas, Dallas, TX, U.S.A.
EUR 7,34
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 0.92.
Editore: Cambridge University Press, 1994
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Anybook.com, Lincoln, Regno Unito
EUR 6,12
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: WorldofBooks, Goring-By-Sea, WS, Regno Unito
EUR 6,37
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Editore: Cambridge University Press, 1985
ISBN 10: 0521246598 ISBN 13: 9780521246590
Lingua: Inglese
Da: ThriftBooks-Dallas, Dallas, TX, U.S.A.
EUR 14,80
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.15.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Better World Books, Mishawaka, IN, U.S.A.
EUR 11,94
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Editore: Cambridge, Cambridge University Press, 1988
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Antiquariat Smock, Freiburg, Germania
EUR 24,00
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: 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].
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Antiquariat Armebooks, Frankfurt am Main, Germania
EUR 25,21
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Editore: Cambridge University Press CUP, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Books Puddle, New York, NY, U.S.A.
EUR 59,28
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 272 Indices.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 57,13
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Majestic Books, Hounslow, Regno Unito
EUR 59,51
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 272 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 60,37
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 272.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Toscana Books, AUSTIN, TX, U.S.A.
EUR 48,46
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.
Editore: Cambridge University Press 1985-06-27, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Chiron Media, Wallingford, Regno Unito
EUR 55,93
Convertire valutaQuantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Goodwill Books, Hillsboro, OR, U.S.A.
EUR 11,74
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: Acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 79,22
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Editore: Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: CitiRetail, Stevenage, Regno Unito
EUR 64,26
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Editore: Cambridge University Press, 1985
ISBN 10: 0521246598 ISBN 13: 9780521246590
Lingua: Inglese
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
EUR 96,46
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: HPB-Red, Dallas, TX, U.S.A.
EUR 4,60
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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!
Editore: Cambridge University Press, 1985
ISBN 10: 0521246598 ISBN 13: 9780521246590
Lingua: Inglese
Da: WorldofBooks, Goring-By-Sea, WS, Regno Unito
EUR 96,72
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: 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.
EUR 77,44
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrellopaperback. Condizione: New. 1st Edition. Special order direct from the distributor.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: BennettBooksLtd, North Las Vegas, NV, U.S.A.
EUR 75,80
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrellopaperback. Condizione: New. In shrink wrap. Looks like an interesting title!
Editore: Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: AussieBookSeller, Truganina, VIC, Australia
EUR 82,60
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 61,78
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Editore: Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: Grand Eagle Retail, Fairfield, OH, U.S.A.
EUR 75,52
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Editore: Cambridge University Press, Cambridge, 1985
Da: J. Wyatt Books, Ottawa, ON, Canada
EUR 37,04
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloSoft cover. Condizione: 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.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 58,31
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 430.
Da: Revaluation Books, Exeter, Regno Unito
EUR 57,40
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 271 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand.
Editore: Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Lingua: Inglese
Da: moluna, Greven, Germania
EUR 61,02
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.