ConceptTheory & Algos
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.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.