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 |
|---|---|---|---|
| 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
