Multiple context-free path querying by matrix multiplication

Multiple context-free path querying by matrix multiplication

Many graph analysis problems can be formulated as formal language-constrained path querying problems where the formal languages are used as constraints for navigational path queries. Recently, the context-free language (CFL) reachability formulation has become very popular and can be used in many ar...

Full description

Bibliographic Details
Main Authors: Ilya V. Epelbaum, Rustam Sh. Azimov, Semyon V. Grigorev
Format: Article
Language:English
Published: Saint Petersburg National Research University of Information Technologies, Mechanics and Optics (ITMO University) 2023-04-01
Series:Naučno-tehničeskij Vestnik Informacionnyh Tehnologij, Mehaniki i Optiki
Subjects:
path querying
mcfg
graph databases
rdf
boolean matrix multiplication
graphblas api
Online Access:https://ntv.ifmo.ru/file/article/21903.pdf

Internet

https://ntv.ifmo.ru/file/article/21903.pdf

Similar Items