Computing label-constraint reachability in graph databases

Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yang Xiang. Computing label-constraint reachability in graph databases. In Ahmed K. Elmagarmid, Divyakant Agrawal, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010. pages 123-134, ACM, 2010. [doi]

@inproceedings{JinHWRX10,
  title = {Computing label-constraint reachability in graph databases},
  author = {Ruoming Jin and Hui Hong and Haixun Wang and Ning Ruan and Yang Xiang},
  year = {2010},
  doi = {10.1145/1807167.1807183},
  url = {http://doi.acm.org/10.1145/1807167.1807183},
  tags = {constraints, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/JinHWRX10},
  cites = {0},
  citedby = {0},
  pages = {123-134},
  booktitle = {Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010},
  editor = {Ahmed K. Elmagarmid and Divyakant Agrawal},
  publisher = {ACM},
  isbn = {978-1-4503-0032-2},
}