Descrição
Part 1: Introduction to Algorithms 1. Algorithms from Ancient to Modern Times 2. Design and Analysis Fundamentals 3. Mathematical Tools for Algorithm Analysis 4. Trees and Applications to Algorithms 5. More on Sorting Algorithms 6. Probabilistic Analysis of Algorithms Part 2: Major Design Strategies 7. The Greedy Method 8. Divide and Conquer 9. Dynamic Programming 10. Backtracking and Branch-and-Bound Part 3: Graph and Network Algorithms 11. Graphs and Digraphs 12. Minimum Spanning Tree and Shortest Path Algorithms 13. Graph Connectivity and Fault Tolerance of Networks 14. Matching and Network Flow Algorithms Part 4: Parallel and Distributed Algorithms 15. Introduction to Parallel Algorithms and Architectures 16. Parallel Design Strategies 17. Searching and the Internet 18. String Matching and Document Processing 19. Distributed Computing Algorithms 20. Distributed Network Algorithms Part 5: Special Topics 21. Balanced Search Trees 22. The Fourier Transform 23. Heuristic Search Strategies 24. Probabilistic and Randomized Algorithms 25. Lower Bound Theory 26. NP-Complete Problems and the Class NC 27. Approximation Algorithms Appendices A: Mathematical Notation and Background B: Linear Data Structures C: Mathematical Induction D: Solving Recurrence Relations E: Elementary Probability Theory F: MPI Examples