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,803 | Conjunctive Regular Path Queries under Injective Semantics | 2023 | PODS | 4.4426077e-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 |
|---|---|---|---|---|
| 364 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025657601 |
| 657 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.00018581389 |
| 808 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.000164132 |
| 964 | G-CORE: A Core for Future Graph Query Languages | 2018 | SIGMOD | 0.00014967208 |
| 1,040 | Querying Graph Databases | 2013 | PODS | 0.00014483577 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010458164 |
| 2,504 | Graph Pattern Matching in GQL and SQL/PGQ | 2022 | SIGMOD | 8.629969e-05 |
| 3,231 | View-Based Query Processing for Regular Path Queries with Inverse | 2000 | PODS | 7.3333516e-05 |
| 5,435 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5074113e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,659 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS | 6.8684407e-05 |
| 9,743 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2856385e-05 |
| 2,345 | Rewriting of Regular Expressions and Regular Path Queries | 1999 | PODS | 8.9933611e-05 |
| 12,939 | Factoring Augmented Regular Chain Programs | 1990 | VLDB | 4.1905499e-05 |
| 1,040 | Querying Graph Databases | 2013 | PODS | 0.00014483577 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010458164 |
| 11,017 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1905499e-05 |
| 4,949 | Querying Graph Patterns | 2011 | PODS | 5.8090034e-05 |
| 5,435 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5074113e-05 |
| 1,445 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.00011937596 |