9 citations · 12 across the 5 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
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…
physics.soc-ph2014★ 2 cited
Node seniority ranking
Vincenzo Fioriti, Marta Chinnici
Recent advances in graph theory suggest that is possible to identify the oldest nodes of a network using only the graph topology. Here we report on applications to heterogeneous re…