ConceptTheory & Algos
Planar graph algorithms
Algorithms optimized for graphs that can be drawn in two dimensions without any edge crossings.
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
4The lectures that define it or assume it, and the concepts next to it.