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

From MaRDI portal
Revision as of 19:27, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    parameterized complexity
    0 references
    fixed-parameter tractable algorithm
    0 references
    multiway cut
    0 references
    digraph homomorphism
    0 references

    Identifiers