Contains:
I: BASIC DESIGN TECHNIQUES AND ALGORITHM ANALYSIS, Basic Concepts, Main algorithm design techniques,
II: GRAPH ALGORITHMS, Representation and Traversal of Graphs, Minimum Spanning Trees, Shortest Paths, Network Flows,
III: INTERNET ALGORITHMS, String Algorithms, Numerical Algorithms, Competitive Analysis, Distributed Computer Network Algorithms,
IV: COMPLEXITY CLASSES, Complexity Theory, Heuristic Techniques, V: COMPUTATIONAL GEOMETRY, Basic Geometric Algorithms, Geometric Data Structures,
VI: SPECIAL TOPICS, Parallel Algorithms, Algorithms for Memory Hierarchies,
VII: ALGORITHMIC PROBLEMS, Problems in algorithm analysis and design techniques, Problems in graphs, NP-complete problems,
VIII: NECESSARY MATHEMATICAL CONCEPTS, Necessary mathematical concepts and formulas, bibliography, Index.