ConceptTheory & Algos
Perfectly identified edges
Two edges in a graph are perfectly identified if every cycle cover in the graph contains both or neither of them.
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
2The lectures that define it or assume it, and the concepts next to it.