41 citations · 157 across the 29 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013
Cache-Oblivious Peeling of Random Hypergraphs
Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano +2
The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random -SAT…
cs.DS2013★ 12 cited
In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond
Paolo Boldi, Sebastiano Vigna
Given a social network, which of its nodes are more central? This question has been asked many times in sociology, psychology and computer science, and a whole plethora of centrali…