Davide Bilò

activity

20112026

most citedLocality-based Network Creation Games

18 citations · 44 across the 26 of their papers we have counts for

collaborators

Showing 2016 · cs.DSShow all

2 papers · 2 filters

cs.DS2016★ 5 cited

Compact and Fast Sensitivity Oracles for Single-Source Distances

Davide Bilò, Luciano Gualà, Stefano Leucci +1

Let $s$ denote a distinguished source vertex of a non-negatively real weighted and undirected graph $G$ with $n$ vertices and $m$ edges. In this paper we present two efficient \emp…

cs.DS2016

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees

Davide Bilò, Luciano Gualà, Stefano Leucci +1

Let $G$ be an $n$ -node and $m$ -edge positively real-weighted undirected graph. For any given integer $f \geq 1$ , we study the problem of designing a sparse \emph{f-edge-fault-tolera…