Context-Free Path Querying by Kronecker Product-Reference-Cited by-同舟云学术

Context-Free Path Querying by Kronecker Product

Published:2020 Issue: Volume: Page:49-59
ISSN:0302-9743
Container-title:Advances in Databases and Information Systems
language:
Short-container-title:

Author:

Orachev Egor,Epelbaum Ilya,Azimov Rustam,Grigorev Semyon^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-54832-2_6

Reference14 articles.

1. Lecture Notes in Computer Science;R Alur,2001

2. Azimov, R., Grigorev, S.: Context-free path querying by matrix multiplication. In: Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), GRADES-NDA 2018, pp. 5:1–5:10. ACM, New York (2018). http://doi.acm.org/10.1145/3210259.3210264

3. Barrett, C., Jacob, R., Marathe, M.: Formal-language-constrained path problems. SIAM J. Comput. 30(3), 809–837 (2000). https://doi.org/10.1137/S0097539798337716

4. Davis, T.A.: Algorithm 9xx: SuiteSparse: GraphBLAS: graph algorithms in the language of sparse linear algebra (2018)

5. Hellings, J.: Querying for paths in graphs using context-free path queries. arXiv preprint arXiv:1502.02242 (2015)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SPbLA: The Library of GPGPU-powered Sparse Boolean Linear Algebra Operations;Journal of Open Source Software;2022-08-20

2. Context-free path querying with all-path semantics by matrix multiplication;Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA);2021-06-20