Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph (Q2849341)

From MaRDI portal
Revision as of 10:07, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    17 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references