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 $k$-vertex subgraphs that appear with frequency greater than a given threshold. FSM has numer…