ConceptTheory & Algos
Cut-balanced orientation
An orientation of an undirected graph where for every cut, the number of edges oriented in one direction is at most a fraction of the total edges in the cut.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.