124 citations · 521 across the 30 of their papers we have counts for
3 papers · 1 filter
FreSCo: Mining Frequent Patterns in Simplicial Complexes
Giulia Preti, Gianmarco De Francisci Morales, Francesco Bonchi
Simplicial complexes are a generalization of graphs that model higher-order relations. In this paper, we introduce simplicial patterns -- that we call simplets -- and generalize th…
Mining Frequent Patterns in Evolving Graphs
Cigdem Aslay, Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales +1
Given a labeled graph, the frequent-subgraph mining (FSM) problem asks to find all the -vertex subgraphs that appear with frequency greater than a given threshold. FSM has numer…
Fully Dynamic Algorithm for Top- Densest Subgraphs
Muhammad Anis Uddin Nasir, Aristides Gionis, Gianmarco De Francisci Morales +1
Given a large graph, the densest-subgraph problem asks to find a subgraph with maximum average degree. When considering the top- version of this problem, a naïve solution is to…