Full Perfect Extension Pruning for Frequent Subgraph Mining

Christian Borgelt, Thorsten Meinl. Full Perfect Extension Pruning for Frequent Subgraph Mining. In Djamel A. Zighed, Shusaku Tsumoto, Zbigniew W. Ras, Hakim Hacid, editors, Mining Complex Data. Volume 165 of Studies in Computational Intelligence, pages 189-205, Springer, 2009. [doi]

@incollection{BorgeltM09,
  title = {Full Perfect Extension Pruning for Frequent Subgraph Mining},
  author = {Christian Borgelt and Thorsten Meinl},
  year = {2009},
  doi = {10.1007/978-3-540-88067-7_11},
  url = {http://dx.doi.org/10.1007/978-3-540-88067-7_11},
  researchr = {https://researchr.org/publication/BorgeltM09},
  cites = {0},
  citedby = {0},
  pages = {189-205},
  booktitle = {Mining Complex Data},
  editor = {Djamel A. Zighed and Shusaku Tsumoto and Zbigniew W. Ras and Hakim Hacid},
  volume = {165},
  series = {Studies in Computational Intelligence},
  publisher = {Springer},
  isbn = {978-3-540-88066-0},
}