EUR 27,92
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. 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!
Librería: Bay State Book Company, North Smithfield, RI, Estados Unidos de America
EUR 31,39
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: very_good.
Librería: ThriftBooks-Atlanta, AUSTELL, GA, Estados Unidos de America
EUR 31,39
Cantidad 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.
EUR 47,45
Cantidad 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 hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN:9783540435501.
EUR 71,40
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
EUR 70,24
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 78,93
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2002
ISBN 10: 3540435506 ISBN 13: 9783540435501
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 83,69
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms. Numerous illustrations, examples, and exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
EUR 76,28
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 77,44
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 90,62
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 508.
EUR 90,55
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 508 Illus.
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de America
EUR 94,33
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2002
ISBN 10: 3540435506 ISBN 13: 9783540435501
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 71,68
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms. Numerous illustrations, examples, and exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference.
EUR 134,03
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 124,55
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. Like New. book.
EUR 48,74
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Hervorragend. Zustand: Hervorragend | Seiten: 508 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
EUR 155,64
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2002
ISBN 10: 3540435506 ISBN 13: 9783540435501
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 178,32
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms. Numerous illustrations, examples, and exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2002
ISBN 10: 3540435506 ISBN 13: 9783540435501
Librería: moluna, Greven, Alemania
EUR 61,78
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Algorithms are first presented on an intuitive basis, followed by a detailed exposition in a literate programming styleCorrectness proofs are given, together with a worst-case analysis of the algorithmsFull C++ implementation of all the algorithms u.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 103,64
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 508.