The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs
Summary: Separates tractable vs. hard regular-language cases for trail and simple-path queries on undirected graphs using graph-minor and group-labeled techniques. Trails are polytime for common simple-chain regexes; simple-paths polytime for a large subclass, full dichotomy remains hard (subsumes a 30-year open problem). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wim Martens
- 2. Tina Popp
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,804 | Conjunctive Regular Path Queries under Injective Semantics | 2023 | PODS | 4.4468701e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 363 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025715157 |
| 690 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.00018099792 |
| 810 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00016428374 |
| 964 | G-CORE: A Core for Future Graph Query Languages | 2018 | SIGMOD | 0.0001497475 |
| 1,037 | Querying Graph Databases | 2013 | PODS | 0.00014502493 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010467069 |
| 2,505 | Graph Pattern Matching in GQL and SQL/PGQ | 2022 | SIGMOD | 8.634551e-05 |
| 3,228 | View-Based Query Processing for Regular Path Queries with Inverse | 2000 | PODS | 7.3405281e-05 |
| 5,424 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5126983e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,652 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS | 6.875313e-05 |
| 9,744 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2897489e-05 |
| 2,342 | Rewriting of Regular Expressions and Regular Path Queries | 1999 | PODS | 9.0015589e-05 |
| 12,929 | Factoring Augmented Regular Chain Programs | 1990 | VLDB | 4.1945683e-05 |
| 1,037 | Querying Graph Databases | 2013 | PODS | 0.00014502493 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010467069 |
| 11,014 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1945683e-05 |
| 4,946 | Querying Graph Patterns | 2011 | PODS | 5.8149362e-05 |
| 5,424 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5126983e-05 |
| 1,444 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.00011946075 |