Author:
Cheng Jiefeng,Yu Jeffrey Xu,Lin Xuemin,Wang Haixun,Yu Philip S.
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proc. of SIGMOD 1989 (1989)
2. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proc. of SODA 2002 (2002)
3. Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic XML trees. In: Proc. of PODS 2002 (2002)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT Press, Cambridge (2001)
5. Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30–55 (1989)
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Answering reachability queries with ordered label constraints over labeled graphs;Frontiers of Computer Science;2023-08-12
2. O’Reach: Even Faster Reachability in Large Graphs;ACM Journal of Experimental Algorithmics;2022-10-21
3. Reachability Labeling for Distributed Graphs;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05
4. A theoretical framework to accelerate scheduling improvement heuristics using a new longest path algorithm in perturbed DAGs;International Journal of Production Research;2022-01-10
5. DLQ;Proceedings of the 30th ACM International Conference on Information & Knowledge Management;2021-10-26