Sign inSign in

Min-bisection

An NP-hard graph problem where the goal is to partition the vertices into two sets of equal size so as to minimize the number of edges between them.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

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.

Graph theory1NP-hardness1

Lecturers

1

    Connections

    1

    The lectures that define it or assume it, and the concepts next to it.

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.