We study a network creation game recently proposed by Fabrikant, Luthra, Maneva, Papadimitriou and Shenker. In this game, each player (vertex) can create links (edges) to other players at a cost of Î±â€¦ (More)

The diameter and the radius of a graph are fundamental topological parameters that have many important practical applications in real world networks. The fastest combinatorial algorithm for bothâ€¦ (More)

Thorup and Zwick showed that for any integer k â‰¥ 1, it is possible to preprocess any positively weighted undirected graph G = (V, E), with |E| = m and |V | = n, in Ã•(kmn) expected time and constructâ€¦ (More)

We obtain a new fully dynamic algorithm for the reachability problem in directed graphs. Our algorithm has an amortized update time of <i>O</i>(<i>m</i>+<i>n</i> log <i>n</i>) and a worst-case queryâ€¦ (More)

For a set S of points in a metric space, a t-spanner is a graph on the points of S such that between any pair of points there is a path in the spanner whose total length is at most t times the actualâ€¦ (More)