2 citations · 3 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020★ 1 cited
Efficient Estimation of Graph Trussness
Alessio Conte, Roberto Grossi, Andrea Marino +1
A -truss is an edge-induced subgraph such that each of its edges belongs to at least triangles of . This notion has been introduced around ten years ago in social n…
cs.DS2020
Zuckerli: A New Compressed Representation for Graphs
Luca Versari, Iulia M. Comsa, Alessio Conte +1
Zuckerli is a scalable compression system meant for large real-world graphs. Graphs are notoriously challenging structures to store efficiently due to their linked nature, which ma…
cs.DS2018
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables
Roberto Grossi, Luca Versari
This paper proposes round-hashing, which is suitable for data storage on distributed servers and for implementing external-memory tables in which each lookup retrieves at most a si…