18 citations · 35 across the 11 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016★ 5 cited
Compact and Fast Sensitivity Oracles for Single-Source Distances
Davide Bilò, Luciano Gualà, Stefano Leucci +1
Let denote a distinguished source vertex of a non-negatively real weighted and undirected graph with vertices and edges. In this paper we present two efficient \emp…
cs.GT2016★ 18 cited
Locality-based Network Creation Games
Davide Bilò, Luciano Gualà, Stefano Leucci +1
Network creation games have been extensively studied, both from economists and computer scientists, due to their versatility in modeling individual-based community formation proces…
cs.DS2016
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
Davide Bilò, Luciano Gualà, Stefano Leucci +1
Let be an -node and -edge positively real-weighted undirected graph. For any given integer , we study the problem of designing a sparse \emph{f-edge-fault-tolera…