ConceptTheory & Algos
Edge reweighting
Transforming edge weights using vertex height functions such that relative path lengths and shortest paths are preserved while making all weights non-negative.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.