First Page | Document Content | |
---|---|---|
Date: 2011-10-23 22:41:14 | 6.889 — Lecture 12: Exact Distance Oracles (a.k.a. Shortest-Path Queries) Christian Sommer (figures extracted from [Dji96, FR06]) October 24, 2011 Distance Oracle: given a graph G = (V, E), preprocess it iAdd to Reading ListSource URL: courses.csail.mit.eduDownload Document from Source WebsiteFile Size: 451,10 KBShare Document on Facebook |