A Trichotomy for Regular Simple Path Queries on Graphs
Guillaume Bagan, Angela Bonifati, Benoit Groz

TL;DR
This paper classifies the complexity of evaluating regular simple path queries on graphs, identifying the boundary between tractable and intractable cases, and providing a detailed complexity trichotomy based on the regular language involved.
Contribution
It establishes a complete classification of regular languages for RSPQ evaluation complexity, revealing a trichotomy and characterizing the tractability frontier.
Findings
Evaluation complexity depends on the regular language: AC0, NL-complete, or NP-complete.
The tractability frontier is characterized by a simple regular expression fragment.
Deciding tractability of finding a regular simple path is NL-complete for DFAs and PSPACE-complete for NFAs or regexes.
Abstract
Regular path queries (RPQs) select nodes connected by some path in a graph. The edge labels of such a path have to form a word that matches a given regular expression. We investigate the evaluation of RPQs with an additional constraint that prevents multiple traversals of the same nodes. Those regular simple path queries (RSPQs) find several applications in practice, yet they quickly become intractable, even for basic languages such as (aa)* or a*ba*. In this paper, we establish a comprehensive classification of regular languages with respect to the complexity of the corresponding regular simple path query problem. More precisely, we identify the fragment that is maximal in the following sense: regular simple path queries can be evaluated in polynomial time for every regular language L that belongs to this fragment and evaluation is NP-complete for languages outside this fragment. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
