Introduction to Algorithms

Autores

• Thomas H. Cormen
• Charles E. Leiserson
• Ronald L. Rivest
• Clifford Stein

Índice

Part I: Foundations

1. Chapter 1: The Role of Algorithms in Computing
2. Chapter 2: Getting Started
3. Chapter 3: Growth of Functions
4. Chapter 4: Recurrences
5. Chapter 5: Probabilistic Analysis and Randomized Algorithms

Part II: Sorting and Order Statistics

1. Chapter 6: Heapsort
2. Chapter 7: Quicksort
3. Chapter 8: Sorting in Linear Time
4. Chapter 9: Medians and Order Statistics

Part III: Data Structures

1. Chapter 10: Elementary Data Structures
2. Chapter 11: Hash Tables
3. Chapter 12: Binary Search Trees
4. Chapter 13: Red-Black Trees
5. Chapter 14: Augmenting Data Structures

Part IV: Advanced Design and Analysis Techniques

1. Chapter 15: Dynamic Programming
2. Chapter 16: Greedy Algorithms
3. Chapter 17: Amortized Analysis

Part V: Advanced Data Structures

1. Chapter 18: B-Trees
2. Chapter 19: Binomial Heaps
3. Chapter 20: Fibonacci Heaps
4. Chapter 21: Data Structures for Disjoint Sets

Part VI: Graph Algorithms

1. Chapter 22: Elementary Graph Algorithms
2. Chapter 23: Minimum Spanning Trees
3. Chapter 24: Single-Source Shortest Paths
4. Chapter 25: All-Pairs Shortest Paths
5. Chapter 26: Maximum Flow

Part VII: Selected Topics

1. Chapter 27: Sorting Networks
2. Chapter 28: Matrix Operations
3. Chapter 29: Linear Programming
4. Chapter 30: Polynomials and the FFT
5. Chapter 31: Number-Theoretic Algorithms
6. Chapter 32: String Matching
7. Chapter 33: Computational Geometry
8. Chapter 34: NP-Completeness
9. Chapter 35: Approximation Algorithms

Part VIII: Appendix: Mathematical Background

• Appendix A: Summations

• Appendix B: Sets, Etc.

• Appendix C: Counting and Probability

• Bibliography

• Index

• List of Figures

• List of Corollaries

• List of Problems

• List of Exercises