Data structures algorithms graph (32 risultati)

Paperback. Condizione: Very Good.

Paperback. Condizione: Good.

Paperback. Condizione: Very Good. Illustrated. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Paperback. Condizione: Very Good.

Paperback. Condizione: Good.

Condizione: good. Book shows general signs of use and handling. May have light wear on the cover or edges and minimal writing or highlighting. Binding remains tight, and pages are clean and readable.

Condizione: acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included.

Condizione: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

paperback. Condizione: 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.

Paperback. Condizione: 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.

Paperback. 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.

Hardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Condizione: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Paperback. Condizione: Used; Good. ***Simply Brit*** Welcome to our online used book store, where affordability meets great quality. Dive into a world of captivating reads without breaking the bank. We take pride in offering a wide selection of used books, from classics to hidden gems, ensuring there is something for every literary palate. All orders are shipped within 24 hours and our lightning fast-delivery within 48 hours coupled with our prompt customer service ensures a smooth journey from ordering to delivery. Discover the joy of reading with us, your trusted source for affordable books that do not compromise on quality.…

Condizione: New.

Paperback. Condizione: Brand New. 235 pages. 8.90x5.98x0.55 inches. In Stock.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

25 x 17 cm. Condizione: Gut. 3 Bände (3 volumes). XII, 260, XII, 336, XII, 284 Seiten (pages) Original Pappband, Hardcover. Mit zwei Stempeln, tadellos erhalten. With two stamps inside, in top condition. (354013641X,3540136428) MIG-31-03A|G58 Sprache: Englisch Gewicht in Gramm: 1265.

Condizione: New.

Condizione: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condizione: As New. Unread book in perfect condition.

paperback. Condizione: New.

Paperback. Condizione: Brand New. 262 pages. 9.25x6.75x0.75 inches. In Stock.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Vol. 2: Graph Algorithms and NP-Completeness.- IV. Algorithms on Graphs.- 1. Graphs and their Representation in a Computer.- 2. Topological Sorting and the Representation Problem.- 3. Transitive Closure of Acyclic Digraphs.- 4. Systematic Exploration of a Graph.- 5. A Close Look at Depth First Search.- 6. Strongly-Connected and Biconnected Components of Directed and Undirected Graphs.- 7. Least Cost Paths in Networks.- 8. Minimum Spanning Trees.- 9. Maximum Network Flow and Applications.- 10. Planar Graphs.- 11. Exercises.- 12. Bibliographic Notes.- V. Path Problems in Graphs and Matrix Multiplication.- 1. General Path Problems.- 2. Two Special Cases: Least Cost Paths and Transitive Closure.- 3. General Path Problems and Matrix Multiplication.- 4. Matrix Multiplication in a Ring.- 5. Boolean Matrix Multiplication and Transitive Closure.- 6. (Min,+)-Product of Matrices and Least Cost Paths.- 7. A Lower Bound on the Monotone Complexity of Matrix Multiplication.- 8. Exercises.- 9. Bibliographic Notes.- VI. NP-Completeness.- 1. Turing Machines and Random Access Machines.- 2. Problems, Languages and Optimization Problems.- 3. Reductions and NP-complete Problems.- 4. The Satisfiability Problem is NP-complete.- 5. More NP-complete Problems.- 6. Solving NP-complete Problems.- 7. Approximation Algorithms.- 8. The Landscape of Complexity Classes.- 9. Exercises.- 10. Bibliographic Notes.- IX. Algorithmic Paradigms.…

Hardcover/ Pappband. Condizione: Gut. 260 S. Mathematics Mathematik Datenstrukturen Algorithmen Sehr guter Zustand/ very good Ex-Library. ha1079990 Sprache: Englisch Gewicht in Gramm: 600.

Paperback. Condizione: Brand New. 3rd edition. 1200 pages. 9.25x8.00x1.75 inches. In Stock.

Condizione: gut. 1984. Graph Algorithms and NP-Completeness 2. Band; Sorting and Searching, 3. band Multi-dimensional Searching and Computational Geometry Data Structures and Algorithms 1, 2 and 3 In deutscher Sprache. pages.

paperback. Condizione: New. Paperback. Pub Date: 2020-06-01 Pages: 188 Language: Chinese Publisher: People's Posts and Telecommunications Publishing House algorithm detailed series of books in 4 volumes. this book is the second volume-graph algorithm and data structure.?There are 6 chapters in this book. mainly introducing 3 topics. namely the search and application of graphs. the shortest path and data structure.?The appendix briefly reviews progressive notation.?Each chapter of this book has quizzes and exercises at t.…