12 citations · 27 across the 14 of their papers we have counts for
4 papers · 1 filter
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…
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…
Proximity Search For Maximal Subgraph Enumeration
Alessio Conte, Andrea Marino, Roberto Grossi +2
This paper proposes a new general technique for maximal subgraph enumeration which we call proximity search, whose aim is to design efficient enumeration algorithms for problems th…
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…