Valda Seminar: Bruno Guillon
Bruno Guillon, Inria Lille 3 May 2019, 10:30-11:30 ENS, S16 Finding paths in large data graphs When dealing with large graphs, classical algorithms for finding paths such as Dijkstra’s Algorithm are unsuitable, because they require to perform too many disk accesses. To avoid the cost of these expensive accesses, while…