ConceptTheory & Algos
K-cut-balanced orientation
An orientation of an undirected graph where the ratio of outgoing edges in any subset to the total number of edges is bounded by a fractional term involving k.
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.