41 citations · 84 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2010★ 7 cited
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
Paolo Boldi, Marco Rosa, Sebastiano Vigna
The neighbourhood function N(t) of a graph G gives, for each t, the number of pairs of nodes <x, y> such that y is reachable from x in less that t hops. The neighbourhood function…
cs.DS2010★ 18 cited
Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks
Paolo Boldi, Marco Rosa, Massimo Santini +1
We continue the line of research on graph compression started with WebGraph, but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the…