Sign inSign in

Maximum independent set on series-parallel graphs

A maximum independent set that can be computed in linear time on series-parallel graphs using a bottom-up approach on their tree decomposition with four table entries representing the inclusion or exclusion of source and target vertices.
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.

    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.