Top-k subgraph matching query in a large graph

Lei Zou, Lei Chen 0002, Yansheng Lu. Top-k subgraph matching query in a large graph. In Aparna S. Varde, Jian Pei, editors, Proceedings of the First Ph.D. Workshop in CIKM, PIKM 2007, Sixteenth ACM Conference on Information and Knowledge Management, CIKM 2007, Lisbon, Portugal, November 9, 2007. pages 139-146, ACM, 2007. [doi]

@inproceedings{ZouCL07,
  title = {Top-k subgraph matching query in a large graph},
  author = {Lei Zou and Lei Chen 0002 and Yansheng Lu},
  year = {2007},
  doi = {10.1145/1316874.1316897},
  url = {http://doi.acm.org/10.1145/1316874.1316897},
  tags = {graph query, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ZouCL07},
  cites = {0},
  citedby = {0},
  pages = {139-146},
  booktitle = {Proceedings of the First Ph.D. Workshop in CIKM, PIKM 2007, Sixteenth ACM Conference on Information and Knowledge Management, CIKM 2007, Lisbon, Portugal, November 9, 2007},
  editor = {Aparna S. Varde and Jian Pei},
  publisher = {ACM},
}