Edge
One word, taught differently in 2 fields. Each use is given apart.
In Theory & Algos
A line in a graph connecting two people who won't fight at dinner.
In Economics
Edges are the branches connecting the nodes in the tree.
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.
In Theory & Algos
1In Economics
1Lectures that assume it
25The first 12 are shown.
- Graph Theory and Coloring
- Matching Problems
- Breadth-First Search (BFS)
- Rounding LP Solutions: Minimum Vertex Cover
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- Depth-First Search (DFS), Topological Sort
- Complexity: Approximation Algorithms
- Media for Thinking the Unthinkable
- Graph Theory II: Minimum Spanning Trees
- The Complexity Class NP
- Permanent is #P-complete
- Incremental Improvement: Max Flow, Min Cut
Connections
34The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures27
- Sequential Games: Moral Hazard, Incentives, and Hungry Lions
- How Hard is too Hard? An Introduction to Complexity
- Graph Theory and Coloring
- Matching Problems
- Breadth-First Search (BFS)
- Rounding LP Solutions: Minimum Vertex Cover
Show 21 moreShow fewer
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- Depth-First Search (DFS), Topological Sort
- Complexity: Approximation Algorithms
- Media for Thinking the Unthinkable
- Graph Theory II: Minimum Spanning Trees
- The Complexity Class NP
- Permanent is #P-complete
- Incremental Improvement: Max Flow, Min Cut
- A New Perspective on Dirac-Type Results in Hypergraphs
- Nodal surplus and the spectral decomposition of the cycle space
- Greedy Algorithms: Minimum Spanning Tree
- Graph Theory III
- From Plato to Plateau: Natural Tilings and Soft Cells
- The Shape of Tiles: Regular and Irregular, Hard and Soft
- Shortest Paths
- Convex Optimization II: Branch-and-Bound Methods
- Approximation Algorithms: Traveling Salesman Problem
- Treewidth Definitions
- Dinur's Proof of the PCP Theorem: Outline
- Proofs, Knowledge, and Computation: Zero-Knowledge Interactive Systems
- Max-Flow Min-Cut Theorem