6.856 — Randomized Algorithms


1. Suppose you are given a graph whose edge lengths are all integers in the range from 0 to B. Suppose also that you are given the all-pairs distance matrix for this graph (it can be constructed by a variant of Seidel’s distance algorithm). Prove that you can identify the (successor matrix representation of the) shortest paths in O(BMM(n) log n) time, where… (More)