Skip to Main content Skip to Navigation
Journal articles

Graph Generators: State of the Art and Open Challenges

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 [136 references]  Display  Hide  Download
Contributor : Tyrex Equipe Connect in order to contact the contributor
Submitted on : Friday, September 25, 2020 - 11:58:20 AM
Last modification on : Tuesday, November 30, 2021 - 1:32:48 PM
Long-term archiving on: : Thursday, December 3, 2020 - 5:44:14 PM


2001.07906 (3).pdf
Files produced by the author(s)



Angela Bonifati, Irena Holubovà, Arnau Prat-Pérez, Sherif Sakr. Graph Generators: State of the Art and Open Challenges. ACM Computing Surveys, Association for Computing Machinery, 2020, 53 (2), ⟨10.1145/3379445⟩. ⟨hal-02435371⟩



Les métriques sont temporairement indisponibles