Resilience for Regular Path Queries: Towards a Complexity Classification
Summary: Resilience for RPQs on graphs: min deletions to falsify an RPQ. Classification: resilience is tractable for local-language RPQs; non-local languages yield data-complexity hardness (four-legged, non-star-free, neutral letter), suggesting a partial dichotomy. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Antoine Amarilli
- 2. Wolfgang Gatterbauer
- 3. Neha Makhija
- 4. Mikaël Monet
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 655 | On Propagation of Deletions and Annotations Through Views | 2002 | PODS | 0.00018593536 |
| 4,256 | Multi-Tuple Deletion Propagation: Approximations and Complexity | 2013 | VLDB | 6.3063725e-05 |
| 4,358 | The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries | 2016 | VLDB | 6.2499e-05 |
| 4,940 | New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins | 2020 | PODS | 5.8131196e-05 |
| 7,024 | A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations | 2023 | SIGMOD | 4.8530001e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,604 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.6944524e-05 |
| 10,903 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS | 4.1905499e-05 |
| 8,827 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS | 4.4369334e-05 |
| 11,017 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1905499e-05 |
| 1,040 | Querying Graph Databases | 2013 | PODS | 0.00014483577 |
| 11,328 | Data Path Queries over Embedded Graph Databases | 2022 | PODS | 4.1905499e-05 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010458164 |
| 4,358 | The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries | 2016 | VLDB | 6.2499e-05 |
| 5,435 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5074113e-05 |
| 4,940 | New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins | 2020 | PODS | 5.8131196e-05 |