EdusalsaDiscover Your Stanford

CS 267

Graph Algorithms

  • Not Offered

3 units

Letter or Credit/No Credit

An introduction to advanced topics in graph algorithms. Focusing on a variety of graph problems, the course will explore topics such as small space graph data structures, approximation algorithms, dynamic algorithms, and algorithms for special graph classes. Topics include: approximation algorithms for shortest paths and graph matching, distance oracles, graph spanners, cliques and graph patterns, dynamic algorithms, graph coloring, algorithms for planar graphs. Prerequisites: 161 or the equivalent mathematical maturity.

Course Prequisites


Section Information Unavailable

Sign Up

To save CS 267 to your course bucketlist

Already Have An Account? Log In