Exercise 8: Don’t get lost. . . We always consider connected, simple, weighted graphs G = (V, E, W ), where W : E → {1, . . . , nO(1) }, and restrict message size to O(log n) bits. Task 1: . . . taking shortcuts! We

First Page		Document Content
Date: 2014-12-09 08:09:49		Exercise 8: Don’t get lost. . . We always consider connected, simple, weighted graphs G = (V, E, W ), where W : E → {1, . . . , nO(1) }, and restrict message size to O(log n) bits. Task 1: . . . taking shortcuts! We Add to Reading List Source URL: resources.mpi-inf.mpg.de Download Document from Source Website File Size: 100,84 KB Share Document on Facebook