Optimal query complexity bounds for finding graphs

Sung-Soon Choi, Jeong Han Kim. Optimal query complexity bounds for finding graphs. Artificial Intelligence, 174(9-10):551-569, 2010. [doi]

@article{ChoiK10-1,
  title = {Optimal query complexity bounds for finding graphs},
  author = {Sung-Soon Choi and Jeong Han Kim},
  year = {2010},
  doi = {10.1016/j.artint.2010.02.003},
  url = {http://dx.doi.org/10.1016/j.artint.2010.02.003},
  tags = {graph query, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ChoiK10-1},
  cites = {0},
  citedby = {0},
  journal = {Artificial Intelligence},
  volume = {174},
  number = {9-10},
  pages = {551-569},
}