Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
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…
cs.DS2016
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…