ConceptTheory & Algos
Diameter problem
The problem of computing the maximum shortest path distance between any pair of vertices in an undirected graph.
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
1Connections
6The lectures that define it or assume it, and the concepts next to it.