Miao Qiao, Hong Cheng, Jeffrey Xu Yu. Querying Shortest Path Distance with Bounded Errors in Large Graphs. In Judith Bayard Cushing, James C. French, Shawn Bowers, editors, Scientific and Statistical Database Management - 23rd International Conference, SSDBM 2011, Portland, OR, USA, July 20-22, 2011. Proceedings. Volume 6809 of Lecture Notes in Computer Science, pages 255-273, Springer, 2011. [doi]
@inproceedings{QiaoCY11,
title = {Querying Shortest Path Distance with Bounded Errors in Large Graphs},
author = {Miao Qiao and Hong Cheng and Jeffrey Xu Yu},
year = {2011},
doi = {10.1007/978-3-642-22351-8_16},
url = {http://dx.doi.org/10.1007/978-3-642-22351-8_16},
tags = {graph query, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/QiaoCY11},
cites = {0},
citedby = {0},
pages = {255-273},
booktitle = {Scientific and Statistical Database Management - 23rd International Conference, SSDBM 2011, Portland, OR, USA, July 20-22, 2011. Proceedings},
editor = {Judith Bayard Cushing and James C. French and Shawn Bowers},
volume = {6809},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-22350-1},
}