摘要:
sci-hub.st 参考文章(14)
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, Philip S. Yu, Fast Computation of Reachability Labeling for Large Graphs Lecture Notes in Computer Science. pp. 961- 979 ,(2006) , 10.1007/11687238_56
Roland Häggkvist, Tristan M. J. Denley, Armen S. Asratian, Bipartite graphs and their applications ,(1998)
J. Teuhola, Path signatures: a way to speed up recursion in relational databases IEEE Transactions on Knowledge and Data Engineering. ,vol. 8, pp. 446- 454 ,(1996) , 10.1109/69.506711
Don Coppersmith, Shmuel Winograd, Matrix multiplication via arithmetic progressions Journal of Symbolic Computation. ,vol. 9, pp. 251- 280 ,(1990) , 10.1016/S0747-7171(08)80013-2
Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick, Reachability and Distance Queries via 2-Hop Labels SIAM Journal on Computing. ,vol. 32, pp. 1338- 1355 ,(2003) , 10.1137/S0097539702403098
Kellogg S. Booth, George S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms Journal of Computer and System Sciences. ,vol. 13, pp. 335- 379 ,(1976) , 10.1016/S0022-0000(76)80045-1
R. P. Dilworth, A Decomposition Theorem for Partially Ordered Sets Classic Papers in Combinatorics. ,vol. 51, pp. 139- 144 ,(2009) , 10.1007/978-0-8176-4842-8_10
Henry S. Warren, A modification of Warshall's algorithm for the transitive closure of binary relations Communications of The ACM. ,vol. 18, pp. 218- 220 ,(1975) , 10.1145/360715.360746
Haixun Wang, Hao He, Jun Yang, P.S. Yu, J.X. Yu, Dual Labeling: Answering Graph Reachability Queries in Constant Time international conference on data engineering. pp. 75- 75 ,(2006) , 10.1109/ICDE.2006.53
Robert Tarjan, Depth-First Search and Linear Graph Algorithms SIAM Journal on Computing. ,vol. 1, pp. 146- 160 ,(1972) , 10.1137/0201010