Design and Analysis of Algorithms: Course Notes Prepared by Samir Khuller of University of Maryland

This book covers core material in data structures and algorithm design, and also helps students prepare for research in the field of algorithms. Topics covered includes: Splay Trees, Amortized Time for Splay Trees, Maintaining Disjoint Sets, Binomial heaps, F-heap, Minimum Spanning Trees, Fredman-Tarjan MST Algorithm, Light Approximate Shortest Path Trees, Matchings, Hopcroft-Karp Matching, Linear Programming, Two processor scheduling, Network Flow, Graph Colouring, Planar Graphs, Min Mean Cycle Problem,Vertex Cover, Weighted Vertex Cover, etc and more.

Popular Posts