-
1
-
-
84976825239
-
Efficient management of transitive relationships in large data and knowledge bases
-
R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. In SIGMOD, pages 253-262, 1989.
-
(1989)
SIGMOD
, pp. 253-262
-
-
Agrawal, R.1
Borgida, A.2
Jagadish, H.V.3
-
2
-
-
39849085497
-
Survey of graph database models
-
Renzo Angles and Claudio Gutierrez. Survey of graph database models. ACM Comput. Surv., 40(1):1-39, 2008.
-
(2008)
ACM Comput. Surv.
, vol.40
, Issue.1
, pp. 1-39
-
-
Angles, R.1
Gutierrez, C.2
-
5
-
-
52649167740
-
An efficient algorithm for answering graph reachability queries
-
Yangjun Chen and Yibin Chen. An efficient algorithm for answering graph reachability queries. In ICDE, pages 893-902, 2008.
-
(2008)
ICDE
, pp. 893-902
-
-
Chen, Y.1
Chen, Y.2
-
6
-
-
33745613502
-
Fast computation of reachability labeling for large graphs
-
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, and Philip S. Yu. Fast computation of reachability labeling for large graphs. In EDBT, pages 961-979, 2006.
-
(2006)
EDBT
, pp. 961-979
-
-
Cheng, J.1
Yu Jeffrey, X.2
Lin, X.3
Wang, H.4
Yu Philip, S.5
-
7
-
-
43349108490
-
Fast computing reachability labelings for large graphs with high compression rate
-
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, and Philip S. Yu. Fast computing reachability labelings for large graphs with high compression rate. In EDBT, pages 193-204, 2008.
-
(2008)
EDBT
, pp. 193-204
-
-
Cheng, J.1
Yu Jeffrey, X.2
Lin, X.3
Wang, H.4
Yu Philip, S.5
-
8
-
-
0000301097
-
Greedy heuristic for the set-covering problem
-
V. Chvá Greedy heuristic for the set-covering problem. Math. Oper. Res, 4:233-235, 1979.
-
(1979)
Math. Oper. Res
, vol.4
, pp. 233-235
-
-
Chvá, V.1
-
9
-
-
84968911272
-
Reachability and distance queries via 2-hop labels
-
Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. In Proceedings of the 13th annual ACM-SIAM Symposium on Discrete algorithms, pages 937-946, 2002.
-
(2002)
Proceedings of the 13th annual ACM-SIAM Symposium on Discrete algorithms
, pp. 937-946
-
-
Cohen, E.1
Halperin, E.2
Kaplan, H.3
Zwick, U.4
-
10
-
-
0024610615
-
A fast parametric maximum flow algorithm and applications
-
G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM J. Comput., 18(1):30-55, 1989.
-
(1989)
SIAM J. Comput.
, vol.18
, Issue.1
, pp. 30-55
-
-
Gallo, G.1
Grigoriadis, M.D.2
Tarjan, R.E.3
-
11
-
-
0025631041
-
A compression technique to materialize transitive closure
-
H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558-598, 1990.
-
(1990)
ACM Trans. Database Syst.
, vol.15
, Issue.4
, pp. 558-598
-
-
Jagadish, H.V.1
-
12
-
-
57149132520
-
Efficiently answering reachability queries on very large directed graphs
-
Ruoming Jin, Yang Xiang, Ning Ruan, and Haixun Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD Conference, pages 595-608, 2008.
-
(2008)
SIGMOD Conference
, pp. 595-608
-
-
Jin, R.1
Xiang, Y.2
Ruan, N.3
Wang, H.4
-
13
-
-
84976707298
-
A graph generation software package
-
New York, NY, USA. ACM
-
Richard Johnsonbaugh and Martin Kalin. A graph generation software package. In SIGCSE '91: Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, pages 151-154, New York, NY, USA, 1991. ACM.
-
(1991)
SIGCSE '91: Proceedings of the Twenty-Second SIGCSE Technical Symposium on Computer Science Education
, pp. 151-154
-
-
Johnsonbaugh, R.1
Kalin, M.2
-
15
-
-
21144445200
-
HOPI: An efficient connection index for complex XML document collections
-
R. Schenkel, A. Theobald, and G. Weikum. HOPI: An efficient connection index for complex XML document collections. In EDBT, 2004.
-
(2004)
EDBT
-
-
Schenkel, R.1
Theobald, A.2
Weikum, G.3
-
16
-
-
0024019807
-
An improved algorithm for transitive closure on acyclic digraphs
-
K. Simon. An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci., 58(1-3):325-346, 1988.
-
(1988)
Theor. Comput. Sci.
, vol.58
, Issue.1-3
, pp. 325-346
-
-
Simon, K.1
-
19
-
-
33749621067
-
Dual labeling: Answering graph reachability queries in constant time
-
Haixun Wang, Hao He, Jun Yang, Philip S. Yu, and Jeffrey Xu Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE '06: Proceedings of the 22nd International Conference on Data Engineering (ICDE'06), page 75, 2006.
-
(2006)
ICDE '06: Proceedings of the 22nd International Conference on Data Engineering (ICDE'06)
, pp. 75
-
-
Wang, H.1
He, H.2
Yang, J.3
Yu Philip, S.4
Yu Jeffrey, X.5
-
20
-
-
29844431949
-
Substructure similarity search in graph databases
-
Xifeng Yan, Philip S. Yu, and Jiawei Han. Substructure similarity search in graph databases. In SIGMOD Conference, pages 766-777, 2005.
-
(2005)
SIGMOD Conference
, pp. 766-777
-
-
Yan, X.1
Yu Philip, S.2
Han, J.3
|