Full duplicate candidate pruning for frequent connected subgraph mining. Alonso, A. G., Carrasco-Ochoa, J. A., Medina-Pagola, J. E., & Trinidad, J. F. M. Integr. Comput. Aided Eng., 17(3):211–225, 2010.
Full duplicate candidate pruning for frequent connected subgraph mining [link]Paper  doi  bibtex   
@article{DBLP:journals/icae/AlonsoCMM10,
  author    = {Andr{\'{e}}s Gago Alonso and
               Jes{\'{u}}s Ariel Carrasco{-}Ochoa and
               Jos{\'{e}} Eladio Medina{-}Pagola and
               Jos{\'{e}} Francisco Mart{\'{\i}}nez Trinidad},
  title     = {Full duplicate candidate pruning for frequent connected subgraph mining},
  journal   = {Integr. Comput. Aided Eng.},
  volume    = {17},
  number    = {3},
  pages     = {211--225},
  year      = {2010},
  url       = {https://doi.org/10.3233/ICA-2010-0342},
  doi       = {10.3233/ICA-2010-0342},
  timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/icae/AlonsoCMM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0