DBScholar

Back to papers

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)

Paper ID
1875
Venue
PODS
Year
2022
Pagerank
5.5738039e-05
Overall Rank
7,658 | 47.46%
DOI
10.1145/3517804.3524149

Incoming Non-self Citations Over Time

Authors

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,190 Conjunctive Regular Path Queries under Injective Semantics 2023 PODS 5.4700577e-05
10,161 Near-Optimality for Single-Source Personalized PageRank 2026 PODS 5.093636e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers