18 citations · 64 across the 17 of their papers we have counts for
Showing 2020 · cs.DSShow all
2 papers · 2 filters
cs.DS2020
Faster motif counting via succinct color coding and adaptive sampling
Marco Bressan, Stefano Leucci, Alessandro Panconesi
We address the problem of computing the distribution of induced connected subgraphs, aka \emph{graphlets} or \emph{motifs}, in large graphs. The current state-of-the-art algorithms…
cs.DS2020
Cutting Bamboo Down to Size
Davide Bilò, Luciano Gualà, Stefano Leucci +2
This paper studies the problem of programming a robotic panda gardener to keep a bamboo garden from obstructing the view of the lake by your house. The garden consists of bambo…