ConceptSystems & CS
Gaussian elimination in a graph context
Gaussian elimination in a graph is a way of manipulating a sparse graph by eliminating a vertex and interconnecting all of its neighbors with new edges to get the same behavior as dense matrix Gaussian elimination.
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.