Exploring the complexity of layout parameters in tournaments and semi-complete digraphs (Q5111401)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exploring the complexity of layout parameters in tournaments and semi-complete digraphs |
scientific article; zbMATH DE number 7204522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploring the complexity of layout parameters in tournaments and semi-complete digraphs |
scientific article; zbMATH DE number 7204522 |
Statements
27 May 2020
0 references
cutwidth
0 references
OLA
0 references
tournament
0 references
semi-complete digraph
0 references
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs (English)
0 references
0.9771810173988342
0 references
0.8345967531204224
0 references
0.7715322375297546
0 references
0.7628619074821472
0 references
0.7128078937530518
0 references
