An algorithmic metatheorem for directed treewidth (Q266806): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963004311 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1410.0589 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:55, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic metatheorem for directed treewidth |
scientific article |
Statements
An algorithmic metatheorem for directed treewidth (English)
0 references
7 April 2016
0 references
combinatorial slice theory
0 references
directed treewidth
0 references
tree-zig-zag number
0 references
monadic second order logic of graphs
0 references
algorithmic metatheorems
0 references
