ConceptTheory & Algos
Undirected graph
A mathematical structure consisting of a vertex set and an edge set where edges have no orientation.
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.
Relation1Sets1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
13The first 12 are shown.
- Hardness within P
- Complexity: Approximation Algorithms
- Spectral Graph Theory III: Eigenvalues of the Laplacian
- Spectral Graph Theory: The Standard Random Walk
- Interactive Proofs: IP=PSPACE
- Dynamic Graphs II
- Interactive Proof Systems, IP
- Spectral Graph Theory: The Markov Transition Operator
- The Semidefinite Programming Relaxation for Max-Cut
- Single-Source Shortest Paths Problem
- Problems in P
- Synchronous Distributed Algorithms: Symmetry-Breaking and Shortest-Paths Spanning Trees
Connections
20The lectures that define it or assume it, and the concepts next to it.
Concepts6
Lectures14
- Spectral Graph Theory: The Quadratic Form
- Hardness within P
- Complexity: Approximation Algorithms
- Spectral Graph Theory III: Eigenvalues of the Laplacian
- Spectral Graph Theory: The Standard Random Walk
- Interactive Proofs: IP=PSPACE
Show 8 moreShow fewer
- Dynamic Graphs II
- Interactive Proof Systems, IP
- Spectral Graph Theory: The Markov Transition Operator
- The Semidefinite Programming Relaxation for Max-Cut
- Single-Source Shortest Paths Problem
- Problems in P
- Synchronous Distributed Algorithms: Symmetry-Breaking and Shortest-Paths Spanning Trees
- Approximately Packing Dijoins Via Nowhere-Zero Flows