LARPQ evaluates two-way regular path queries by expressing the simultaneous traversal of graph and query automaton as Boolean linear algebra, with a correctness proof and a mixed but often favorable performance evaluation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Single-Source Regular Path Querying in Terms of Linear Algebra
LARPQ evaluates two-way regular path queries by expressing the simultaneous traversal of graph and query automaton as Boolean linear algebra, with a correctness proof and a mixed but often favorable performance evaluation.