A new algorithm for mining frequent connected subgraphs based on adjacency matrices
Andrés Gago-Alonso, Abel Puentes-Luberta, Jesús Ariel Carrasco-Ochoa, José Eladio Medina-Pagola, José Fco. Martínez-Trinidad · Intelligent Data Analysis · 2010
Most of the Frequent Connected Subgraph Mining (FCSM) algorithms have been focused on detecting duplicate candidates using canonical form (CF) tests. CF tests have high computational complexity, which affects the efficiency of graph miners. In this p