Sign inSign in
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.
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.

Gaussian elimination1Graph theory1Sparse matrices1

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    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.