S
Stefano Leucci
Researcher at University of L'Aquila
Publications - 79
Citations - 721
Stefano Leucci is an academic researcher from University of L'Aquila. The author has contributed to research in topics: Stretch factor & Spanning tree. The author has an hindex of 14, co-authored 73 publications receiving 592 citations. Previous affiliations of Stefano Leucci include Max Planck Society & ETH Zurich.
Papers
More filters
Proceedings ArticleDOI
Counting Graphlets: Space vs Time
TL;DR: This work shows that a careful implementation of color coding (CC) can push the limits of the state of the art, both in terms of the size of the input graph and of that of the graphlets, and formally shows that the mixing time of the MC approach is too high in general.
Journal ArticleDOI
Motif Counting Beyond Five Nodes
TL;DR: This work shows, perhaps surprisingly, that very simple and natural algorithms based on Monte Carlo sampling of Markov Chains are outperformed by color coding (CC) [2], a sophisticated algorithmic technique that is extended to the case of graphlet sampling and for which it is proved strong statistical guarantees.
Journal ArticleDOI
Motivo: fast motif counting via succinct color coding and adaptive sampling
TL;DR: Motif counting via color coding (MOTIYO) as discussed by the authors is the state-of-the-art algorithm for graph motif counting. But it requires a high-end desktop machine.
Posted Content
Improved Purely Additive Fault-Tolerant Spanners
TL;DR: In this article, the authors focus on additive spanners, which are able to preserve their additive stretch even when one edge fails, and show how to improve the sparsest known spanners in terms of sparsity or stretch.
Posted Content
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
TL;DR: In this article, the problem of designing a sparse EFT (f-edge-fault-tolerant) (2|F|+1)$-ASPT of size O(f n) was studied.