Data structures algorithms graph par mehlhorn (11 résultats)

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

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

25 x 17 cm. Etat : 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.

Etat : New.

Etat : As New. Unread book in perfect condition.

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

Taschenbuch. Etat : 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. Etat : Gut. 260 S. Mathematics Mathematik Datenstrukturen Algorithmen Sehr guter Zustand/ very good Ex-Library. ha1079990 Sprache: Englisch Gewicht in Gramm: 600.

Etat : 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.