An efficient algorithm for discovering frequent subgraphs. Kuramochi, M. and Karypis, G. IEEE Trans Knowl Data En, 16(9):1038–1051, 2004.
bibtex   
@Article{kuramochi04efficient,
  author    = {Michihiro Kuramochi and George Karypis},
  title     = {An efficient algorithm for discovering frequent subgraphs},
  journal   = {IEEE Trans Knowl Data En},
  year      = {2004},
  volume    = {16},
  number    = {9},
  pages     = {1038--1051},
  keywords  = {substructure},
  owner     = {fhufsky},
  timestamp = {2012.07.27},
}
Downloads: 0