ConceptTheory & Algos
Vertex
A dot in a graph representing each person.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
15The first 12 are shown.
- Graph Theory and Coloring
- Breadth-First Search (BFS)
- Constraints: Interpreting Line Drawings
- Depth-First Search (DFS), Topological Sort
- Complexity: Approximation Algorithms
- Media for Thinking the Unthinkable
- Community detection with the Bethe-Hessian
- Graph Theory II: Minimum Spanning Trees
- Permanent is #P-complete
- Nodal surplus and the spectral decomposition of the cycle space
- Greedy Algorithms: Minimum Spanning Tree
- Graph Theory III
Connections
22The lectures that define it or assume it, and the concepts next to it.
Lectures16
- How Hard is too Hard? An Introduction to Complexity
- Graph Theory and Coloring
- Breadth-First Search (BFS)
- Constraints: Interpreting Line Drawings
- Depth-First Search (DFS), Topological Sort
- Complexity: Approximation Algorithms
Show 10 moreShow fewer
- Media for Thinking the Unthinkable
- Community detection with the Bethe-Hessian
- Graph Theory II: Minimum Spanning Trees
- Permanent is #P-complete
- Nodal surplus and the spectral decomposition of the cycle space
- Greedy Algorithms: Minimum Spanning Tree
- Graph Theory III
- More Counting and Generating Functions
- Approximation Algorithms: Traveling Salesman Problem
- Treewidth Definitions