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

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

collaborators

5 papers

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…

cs.SI2013

Topological security assessment of technological networks

Enzo Fioriti, Marta Chnnici, Andrea Arbore

The spreading of dangerous malware or faults in inter-dependent networks of electronics devices has raised deep concern, because from the ICT networks infections may propagate to o…

math-ph2012

Predicting the sources of an outbreak with a spectral technique

Vincenzo Fioriti, Marta Chinnici

The epidemic spreading of a disease can be described by a contact network whose nodes are persons or centers of contagion and links heterogeneous relations among them. We provide a…

math.NA2012

A PCG Implementation of an Elliptic Kernel in an Ocean Global Circulation Model Based on GPU Libraries

Salvatore Cuomo, Pasquale De Michele, Raffaele Farina +1

In this paper an inverse preconditioner for the numerical solution of an elliptic Laplace prob- lem of a global circulation ocean model is presented. The inverse preconditiong tech…