15 citations · 25 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022★ 9 cited
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…
cs.DS2020
Mining Dense Subgraphs with Similar Edges
Polina Rozenshtein, Giulia Preti, Aristides Gionis +1
When searching for interesting structures in graphs, it is often important to take into account not only the graph connectivity, but also the metadata available, such as node and e…