Skip to Main content Skip to Navigation
Journal articles

A trichotomy for regular simple path queries on graphs

Guillaume Bagan 1 Angela Bonifati 2, 3 Benoit Groz 4
2 TYREX - Types and Reasoning for the Web
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
3 BD - Base de Données
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : We focus on the computational complexity of regular simple path queries (RSPQs). We consider the following problem RSPQ(L) for a regular language L: given an edge-labeled digraph Gand two nodes xand y, is there a simple path from x to y that forms a word belonging to L? We fully characterize the frontier between tractability and intractability for RSPQ(L). More precisely, we prove RSPQ(L)is either AC0, NL-complete or NP-complete depending on the language L. We also provide a simple characterization of the tractable fragment in terms of regular expressions. Finally, we also discuss the complexity of deciding whether a language L belongs to the fragment above. We consider several alternative representations of L: DFAs, NFAs or regular expressions, and prove that this problem is NL-complete for the first representation and PSpace-complete for the other two.
Document type :
Journal articles
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Tyrex Equipe Connect in order to contact the contributor
Submitted on : Friday, September 25, 2020 - 11:49:08 AM
Last modification on : Friday, January 21, 2022 - 3:11:23 AM
Long-term archiving on: : Thursday, December 3, 2020 - 5:43:14 PM


jcss19 (1).pdf
Files produced by the author(s)



Guillaume Bagan, Angela Bonifati, Benoit Groz. A trichotomy for regular simple path queries on graphs. Journal of Computer and System Sciences, Elsevier, 2020, 108, pp.29-48. ⟨10.1016/j.jcss.2019.08.006⟩. ⟨hal-02435355⟩



Les métriques sont temporairement indisponibles