1 citations · 1 across the 2 of their papers we have counts for
5 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…
Combinatorial Algorithms for String Sanitization
Giulia Bernardini, Huiping Chen, Alessio Conte +6
String data are often disseminated to support applications such as location-based service provision or DNA sequence analysis. This dissemination, however, may expose sensitive patt…
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte +2
The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related p…
Enumerating Cyclic Orientations of a Graph
Alessio Conte, Roberto Grossi, Andrea Marino +1
Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obta…