EdusalsaDiscover Your Stanford

MS&E 316

Discrete Mathematics and Algorithms (CME 305)

  • Not Offered

3 units

Letter or Credit/No Credit

Topics: Basic Algebraic Graph Theory, Matroids and Minimum Spanning Trees, Submodularity and Maximum Flow, NP-Hardness, Approximation Algorithms, Randomized Algorithms, The Probabilistic Method, and Spectral Sparsification using Effective Resistances. Topics will be illustrated with applications from Distributed Computing, Machine Learning, and large-scale Optimization. Prerequisites: CS 261 is highly recommended, although not required.

Course Prequisites

Sign Up

To save MS&E 316 to your course bucketlist

Already Have An Account? Log In