by Steven Skiena
Available on:
Online Video (Free)
Provide a rigorous introduction to worst-case asymptotic algorithm analysis, Develop classical graph and combinatorial algorithms for such problems as sorting, shortest paths and minimum spanning trees, and Introduce the concept of computational intractability and NP completeness.