Entanglement and the complexity of directed graphs (Q1929212): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977644778 / rank | |||
Normal rank | |||
Revision as of 22:49, 19 March 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
