%0 Journal Article %1 journals/tods/JinRXW11 %A Jin, Ruoming %A Ruan, Ning %A Xiang, Yang %A Wang, Haixun %D 2011 %J ACM Trans. Database Syst. %K dblp %N 1 %P 7:1-7:44 %T Path-tree: An efficient reachability indexing scheme for large directed graphs. %U http://dblp.uni-trier.de/db/journals/tods/tods36.html#JinRXW11 %V 36

@article{journals/tods/JinRXW11, added-at = {2018-11-06T00:00:00.000+0100}, author = {Jin, Ruoming and Ruan, Ning and Xiang, Yang and Wang, Haixun}, biburl = {https://www.bibsonomy.org/bibtex/284e3686a928214e2ac6bc9a758120dee/dblp}, ee = {https://doi.org/10.1145/1929934.1929941}, interhash = {2c21e2365728ecb9cbfd69a0eee30579}, intrahash = {84e3686a928214e2ac6bc9a758120dee}, journal = {ACM Trans. Database Syst.}, keywords = {dblp}, number = 1, pages = {7:1-7:44}, timestamp = {2018-11-07T11:50:01.000+0100}, title = {Path-tree: An efficient reachability indexing scheme for large directed graphs.}, url = {http://dblp.uni-trier.de/db/journals/tods/tods36.html#JinRXW11}, volume = 36, year = 2011 }