Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism (Q5363762)

From MaRDI portal
Revision as of 11:17, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6784960
Language Label Description Also known as
English
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism
scientific article; zbMATH DE number 6784960

    Statements

    0 references
    0 references
    0 references
    0 references
    29 September 2017
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractable algorithm
    0 references
    multiway cut
    0 references
    digraph homomorphism
    0 references
    cs.DS
    0 references
    math.CO
    0 references
    Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references