
Efficient Estimation of Graph Trussness
A ktruss is an edgeinduced subgraph H such that each of its edges belo...
read it

Zuckerli: A New Compressed Representation for Graphs
Zuckerli is a scalable compression system meant for large realworld gra...
read it

Proximity Search For Maximal Subgraph Enumeration
This paper considers the subgraphs of an input graph that satisfy a give...
read it

String Sanitization: A Combinatorial Approach
String data are often disseminated to support applications such as locat...
read it

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
The girth of a graph is the length of its shortest cycle. Due to its rel...
read it

Listing Maximal Subgraphs in Strongly Accessible Set Systems
Algorithms for listing the subgraphs satisfying a given property (e.g.,b...
read it
Alessio Conte
is this you? claim profile