Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang. Efficiently answering reachability queries on very large directed graphs. In Jason Tsong-Li Wang, editor, Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008. pages 595-608, ACM, 2008. [doi]
@inproceedings{JinXRW08,
title = {Efficiently answering reachability queries on very large directed graphs},
author = {Ruoming Jin and Yang Xiang and Ning Ruan and Haixun Wang},
year = {2008},
doi = {10.1145/1376616.1376677},
url = {http://doi.acm.org/10.1145/1376616.1376677},
tags = {graph query, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/JinXRW08},
cites = {0},
citedby = {0},
pages = {595-608},
booktitle = {Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008},
editor = {Jason Tsong-Li Wang},
publisher = {ACM},
isbn = {978-1-60558-102-6},
}