most citedIdentifying sparse and dense sub-graphs in large graphs with a fast algorithm

9 citations · 9 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2014★ 9 cited

Identifying sparse and dense sub-graphs in large graphs with a fast algorithm

Vincenzo Fioriti, Marta Chinnici

Identifying the nodes of small sub-graphs with no a priori information is a hard problem. In this work, we want to find each node of a sparse sub-graph embedded in both dynamic and…