Mining Frequent Pa erns in Evolving Graphs

Given a labeled graph, the frequent-subgraph mining (FSM) problem asks to €nd all the k-vertex subgraphs that appear with frequency greater than a given threshold. FSM has numerous applications ranging from biology to network science, as it provides a compact summary of the characteristics of the graph. However, the task is challenging, even more so for… (More)