The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network str...
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
Workflow and Web Services have the main role in the development and in the realisation of B2B architectures. In this context, the principal target is to compose many services supp...
Francesco Calabrese, Giovanni Di Dio, Anna Rita Fa...
Structural analysis of web pages has been proposed several times and for a number of reasons and purposes, such as the re-flowing of standard web pages to fit a smaller PDA screen....
Fabio Vitali, Angelo Di Iorio, Elisa Ventura Campo...