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 (University of Bayreuth)
- 2. Tina Popp (University of Bayreuth)
BibTeX Citation
@inproceedings{martens_pods22,
address = {New York, NY, USA},
series = {{PODS} '22},
title = {{The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs}},
url = {https://dl.acm.org/doi/10.1145/3517804.3524149},
doi = {10.1145/3517804.3524149},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Martens, Wim and Popp, Tina},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,380 | Conjunctive Regular Path Queries under Injective Semantics | 2023 | PODS | 5.3271197e-05 |
| 10,456 | Near-Optimality for Single-Source Personalized PageRank | 2026 | PODS | 4.9605343e-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 |
|---|---|---|---|---|
| 306 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00021533151 |
| 536 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.00016738841 |
| 703 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00014638214 |
| 719 | Querying Graph Databases | 2013 | PODS | 0.00014493767 |
| 854 | G-CORE: A Core for Future Graph Query Languages | 2018 | SIGMOD | 0.00013432811 |
| 1,428 | Graph Pattern Matching in GQL and SQL/PGQ | 2022 | SIGMOD | 0.000106884 |
| 1,474 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010526746 |
| 3,169 | View-Based Query Processing for Regular Path Queries with Inverse | 2000 | PODS | 7.557345e-05 |
| 5,133 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 6.2458323e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,483 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS |
| 2 | 9,445 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS |
| 3 | 2,043 | Rewriting of Regular Expressions and Regular Path Queries | 1999 | PODS |
| 4 | 13,461 | Factoring Augmented Regular Chain Programs | 1990 | VLDB |
| 5 | 719 | Querying Graph Databases | 2013 | PODS |
| 6 | 1,474 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 7 | 11,616 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 8 | 5,122 | Querying Graph Patterns | 2011 | PODS |
| 9 | 5,133 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 10 | 1,592 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |