1 |
R. Agrawal, A. Borgida, and H. V. Jagadish, "Efficient management of transitive relationships in large data and knowledge bases," ACM SIGMOD Record, vol. 18, no. 2, pp. 253-262, 1989.
DOI
|
2 |
H. Wei, J. X. Yu, C. Lu, and R. Jin, "Reachability querying: an independent permutation labeling approach," Proceedings of the VLDB Endowment, vol. 7, no. 12, pp. 1191-1202, 2014.
DOI
|
3 |
H. Gabr and T. Kahveci, "Signal reachability facilitates characterization of probabilistic signaling networks," BMC Bioinformatics, vol. 16, article no. S6, 2015.
|
4 |
D. H. Im, S. W. Lee, and H. J. Kim, "A version management framework for RDF triple stores," International Journal of Software Engineering and Knowledge Engineering, vol. 22, no. 1, pp. 85-106, 2012.
DOI
|
5 |
S. M. Albladi and G. R. Weir, "User characteristics that influence judgment of social engineering attacks in social networks," Human-centric Computing and Information Sciences, vol. 8, article no. 5, 2018.
|
6 |
K. Sriwanna, T. Boongoen, and N. Iam-On, "Graph clustering-based discretization of splitting and merging methods (GraphS and GraphM)," Human-centric Computing and Information Sciences, vol. 7), article no. 21, 2017.
|
7 |
E. Cohen, E. Halperin, H. Kaplan, and U. Zwick, "Reachability and distance queries via 2-hop labels," SIAM Journal on Computing, vol. 32, no. 5, pp. 1338-1355. 2003.
DOI
|
8 |
Y. Derdour, B. Kechar, and M. Faycal-Khelfi, "Using mobile data collectors to enhance energy efficiency and reliability in delay tolerant wireless sensor networks," Journal of Information Processing Systems, vol. 12, no. 2, pp. 275-294, 2016.
DOI
|
9 |
K. E. Moustafa and H. Hafid, "Self-Identification of Boundary's nodes in wireless sensor networks," Journal of Information Processing Systems, vol. 13, no. 1, pp. 128-140, 2017.
DOI
|
10 |
J. X. Yu and J. Cheng, "Graph reachability queries: a survey," in Managing and Mining Graph Data. Boston, MA: Springer, 2010, pp. 181-215.
|
11 |
J. Su, Q. Zhu, H. Wei, and J. X. Yu, "Reachability querying: Can it be even faster?" IEEE Transactions on Knowledge and Data Engineering, vol. 29, no. 3, pp. 683-697, 2016.
DOI
|
12 |
J. Ahn, "Optimization techniques for 2-hop labeling of dynamic directed acyclic graphs," in Proceedings of the Doctoral Consortium at the 15th International Semantic Web Conference (ISWC 2016), Kobe, Japan, 2016, pp. 1-8.
|
13 |
A. D. Zhu, W. Lin, S. Wang, and X. Xiao, "Reachability queries on large dynamic graphs: a total order approach," in Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, Snowbird, UT, 2014, pp. 1323-1334.
|
14 |
K. Simon, "An improved algorithm for transitive closure on acyclic digraphs," Theoretical Computer Science, vol. 58, no. 1-3, pp. 325-346, 1988.
DOI
|
15 |
S. Seufert, A. Anand, S. Bedathur, and G. Weikum, "Ferrari: flexible and efficient reachability range assignment for graph indexing," in Proceedings of 2013 IEEE 29th International Conference on Data Engineering (ICDE), Brisbane, Australia, 2013, pp. 1009-1020.
|
16 |
G. Wu, K. Zhang, C. Liu, and J. Li, "Adapting prime number labeling scheme for directed acyclic graphs," in Database Systems for Advanced Applications. Heidelberg: Springer, 2016, pp. 787-796.
|
17 |
J. Ahn, T. Lee, and D. H. Im, "Efficiently answering reachability queries for tree-structured data in repetitive prime number labeling schemes," Applied Sciences, vol. 8, article no. 785, 2018.
|
18 |
H. Yildirim, V. Chaoji, and M. J. Zaki, "GRAIL: a scalable index for reachability queries in very large graphs," The VLDB Journal, vol. 21, no. 4, pp. 509-534, 2012.
DOI
|