Pages that link to "Item:Q2009646"
From MaRDI portal
The following pages link to A trichotomy for regular simple path queries on graphs (Q2009646):
Displaying 9 items.
- Path querying on acyclic graphs using Boolean grammars (Q2027852) (← links)
- Formal languages in information extraction and graph databases (Q2106616) (← links)
- The complexity of regular expressions and property paths in SPARQL (Q2943554) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Evaluation and Enumeration Problems for Regular Path Queries (Q3305367) (← links)
- Formal language constrained path problems (Q5054859) (← links)
- (Q5874277) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)
- A Trichotomy for Regular Trail Queries (Q6178699) (← links)