2 citations · 4 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
An Efficient Streaming Algorithm for Approximating Graphlet Distributions
Marco Bressan, T-H. Hubert Chan, Qipeng Kuang +1
In recent years, the problem of computing the frequencies of the induced -vertex subgraphs of a graph, or \emph{-graphlets}, has become central. One approach for this problem…
cs.DS2023★ 1 cited
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees
Marco Bressan, Mauro Sozio
We give the first algorithm that maintains an approximate decision tree over an arbitrary sequence of insertions and deletions of labeled examples, with strong guarantees on the wo…
cs.DS2020
Better Fewer but Better: Community Search with Outliers
Francesco Bonchi, Lorenzo Severini, Mauro Sozio
Given a set of vertices in a network, that we believe are of interest for the application under analysis, community search is the problem of producing a subgraph potentially explai…