DAG-width and circumference of digraphs (Q2811203)
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 6591592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | DAG-width and circumference of digraphs |
scientific article; zbMATH DE number 6591592 |
Statements
10 June 2016
0 references
DAG-width
0 references
\(k\)-linkage problem
0 references
bounded cycle length
0 references
polynomial algorithm
0 references
cops-and-robbers game
0 references
DAG-width and circumference of digraphs (English)
0 references
0.7845540046691895
0 references
0.7582591772079468
0 references
0.7573739290237427
0 references
0.7568579316139221
0 references
0.7338089346885681
0 references
