Publicado por Cambridge University Press, 1985
ISBN 10: 0521246598 ISBN 13: 9780521246590
Idioma: Inglés
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
EUR 10,64
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Publicado por Cambridge University Press, 1994
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Anybook.com, Lincoln, Reino Unido
EUR 5,91
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521246598 ISBN 13: 9780521246590
Idioma: Inglés
Librería: WorldofBooks, Goring-By-Sea, WS, Reino Unido
EUR 10,47
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardback. Condición: 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.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521246598 ISBN 13: 9780521246590
Idioma: Inglés
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
EUR 14,29
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.15.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
EUR 7,52
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
EUR 7,52
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Publicado por Cambridge, Cambridge University Press, 1988
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Antiquariat Smock, Freiburg, Alemania
EUR 24,00
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Gut. Formateinband: Broschierte Ausgabe XII, 259 S. (23 cm) Reprinted; Gut und sauber erhalten. // VERSAND ERST WIEDER AB DEM 22.08.2025 // SHIPMENT AFTER AUGUST 22. // 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].
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Antiquariat Armebooks, Frankfurt am Main, Alemania
EUR 25,21
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 57,59
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Cambridge University Press CUP, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 54,61
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 272 Indices.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Majestic Books, Hounslow, Reino Unido
EUR 55,53
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 272 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Goodwill Books, Hillsboro, OR, Estados Unidos de America
EUR 4,44
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 56,89
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 272.
Publicado por Cambridge University Press 1985-06-27, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Chiron Media, Wallingford, Reino Unido
EUR 53,97
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPaperback. Condición: New.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 67,56
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Toscana Books, AUSTIN, TX, Estados Unidos de America
EUR 64,55
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.
Publicado por Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: CitiRetail, Stevenage, Reino Unido
EUR 62,01
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
EUR 4,44
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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!
Publicado por Cambridge University Press, Cambridge, 1985
Librería: J. Wyatt Books, Ottawa, ON, Canada
EUR 35,78
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoSoft cover. Condición: 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.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 90,67
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: BennettBooksLtd, North Las Vegas, NV, Estados Unidos de America
EUR 73,22
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: New. In shrink wrap. Looks like an interesting title!
Publicado por Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 80,59
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 59,68
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, Cambridge, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America
EUR 72,95
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 56,27
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 430.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 55,39
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 271 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand.
Publicado por Cambridge University Press, 1985
ISBN 10: 0521288819 ISBN 13: 9780521288811
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 61,02
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: 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.