Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph (Q2849341)
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: Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph |
scientific article |
Statements
Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph (English)
0 references
17 September 2013
0 references
0.8345967531204224
0 references
0.8315861821174622
0 references
0.8207687735557556
0 references
0.7644698619842529
0 references
0.7642198801040649
0 references
