Evaluating graph queries using semantic treewidth (Q6902065)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8119427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Evaluating graph queries using semantic treewidth |
scientific article; zbMATH DE number 8119427 |
Statements
Evaluating graph queries using semantic treewidth (English)
0 references
11 November 2025
0 references
conjunctive two-way regular path queries
0 references
fixed-parameter tractable evaluation
0 references
semantic treewidth
0 references
Datalog encoding
0 references
optimization
0 references
0 references
