Entanglement and the complexity of directed graphs (Q1929212): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:16, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Entanglement and the complexity of directed graphs |
scientific article |
Statements
Entanglement and the complexity of directed graphs (English)
0 references
7 January 2013
0 references
structural graph theory
0 references
graph searching games
0 references
parity games
0 references
digraph algorithms
0 references
treewidth
0 references
DAG-width
0 references
Kelly-width
0 references
