61 citations · 61 across the 1 of their papers we have counts for
2 papers
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…
cs.DS2019★ 61 cited
Distance-generalized Core Decomposition
Francesco Bonchi, Arijit Khan, Lorenzo Severini
The -core of a graph is defined as the maximal subgraph in which every vertex is connected to at least other vertices within that subgraph. In this work we introduce a dista…