Your selections:
Efficiently answering reachability queries on very large directed graphs
- Jin, Ruoming, Xiang, Yang, Ruan, Ning, Wang, Haixun
Computing label-constraint reachability in graph databases
- Jin, Ruoming, Hong, Hui, Wang, Haixun, Ruan, Ning, Yang, Xiang
Path-tree: An efficient reachability indexing scheme for large directed graphs
- Jin, Ruoming, Ruan, Ning, Xiang, Yang, Wang, Haixun
Are you sure you would like to clear your session, including search history and login status?