GEN 11132

Graph and Combinatorial Optimization

Stanford University · UGRD · Fall 2026

1 section
Add to a schedule

Catalog description

Optimization problems dealing with graph structure. Topics: introduction to graph theory; combinatorial optimization problems on networks including network flows, matching, and assignment problems; NP-completeness and approximation algorithms; applications in the study of social networks, market design, and bioinformatics. Prerequisites: basic concepts in linear algebra, probability theory, and programming methodology.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 3 hours ago

001

Availability not recently verified
Class #stanford-11132Fall 2026UGRD3 credits
Days & times
No scheduled meeting time
Meeting dates
Location
Instructor
Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?