Mining Closed Frequent Free Trees in Graph Databases

Peixiang Zhao, Jeffrey Xu Yu. Mining Closed Frequent Free Trees in Graph Databases. In Kotagiri Ramamohanarao, P. Radha Krishna, Mukesh K. Mohania, Ekawit Nantajeewarawat, editors, Advances in Databases: Concepts, Systems and Applications, 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007, Bangkok, Thailand, April 9-12, 2007, Proceedings. Volume 4443 of Lecture Notes in Computer Science, pages 91-102, Springer, 2007. [doi]

@inproceedings{ZhaoY07:0,
  title = {Mining Closed Frequent Free Trees in Graph Databases},
  author = {Peixiang Zhao and Jeffrey Xu Yu},
  year = {2007},
  doi = {10.1007/978-3-540-71703-4_10},
  url = {http://dx.doi.org/10.1007/978-3-540-71703-4_10},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ZhaoY07%3A0},
  cites = {0},
  citedby = {0},
  pages = {91-102},
  booktitle = {Advances in Databases: Concepts, Systems and Applications, 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007, Bangkok, Thailand, April 9-12, 2007, Proceedings},
  editor = {Kotagiri Ramamohanarao and P. Radha Krishna and Mukesh K. Mohania and Ekawit Nantajeewarawat},
  volume = {4443},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-71702-7},
}