Sign inSign in

Locally checkable labeling

A class of problems in the LOCAL model where a valid solution can be verified locally within a constant radius.
as Seth Pettie defines itUniversity of Michigan
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.

Distributed graph algorithms1Graph coloring1LOCAL model1

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.