Sign inSign in

Cycle cover

A collection of vertex-disjoint directed cycles that covers every vertex in a directed graph exactly once.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Connections

    9

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

    Concepts8

    Show 2 more

    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.