Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830)

From MaRDI portal
Revision as of 01:54, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized algorithms for min-max multiway cut and list digraph homomorphism
scientific article

    Statements

    Parameterized algorithms for min-max multiway cut and list digraph homomorphism (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2017
    0 references
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractable algorithm
    0 references
    multiway cut
    0 references
    digraph homomorphism
    0 references