Exploring the complexity of layout parameters in tournaments and semicomplete digraphs (Q4554366)
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 semicomplete digraphs |
scientific article; zbMATH DE number 6979228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploring the complexity of layout parameters in tournaments and semicomplete digraphs |
scientific article; zbMATH DE number 6979228 |
Statements
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs (English)
0 references
13 November 2018
0 references
kernelization theory
0 references
cutwidth
0 references
semicomplete digraphs
0 references
tournaments
0 references
0.9771810173988342
0 references
0.8315861821174622
0 references
0.7682206034660339
0 references
0.7600699067115784
0 references
0.7369900941848755
0 references
