Data Structures and Algorithms 2
Springer Berlin (Verlag)
978-3-642-69899-6 (ISBN)
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.
| Erscheint lt. Verlag | 25.12.2011 |
|---|---|
| Reihe/Serie | Monographs in Theoretical Computer Science. An EATCS Series |
| Zusatzinfo | XII, 262 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 170 x 242 mm |
| Gewicht | 483 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Datenbanken |
| Informatik ► Software Entwicklung ► User Interfaces (HCI) | |
| Informatik ► Theorie / Studium ► Algorithmen | |
| Schlagworte | Algorithm analysis and problem complexity • algorithms • data structures • Graph • Structures |
| ISBN-10 | 3-642-69899-9 / 3642698999 |
| ISBN-13 | 978-3-642-69899-6 / 9783642698996 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
