Sign inSign in

Intro vertex algorithm for 3-coloring

For an intro vertex introducing a vertex vv, the entry is false if vv shares a color with any adjacent vertex uu, and otherwise checks if the restricted coloring on the child bag is extendable.
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.

Lecturers

1

    Connections

    3

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

    Concepts2

    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.