18 citations · 30 across the 4 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.CC2010
Random Generation and Approximate Counting of Combinatorial Structures
Massimo Santini
The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution. Since efficient rank impli…
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…