Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
scientific article

    Statements

    Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (English)
    0 references
    0 references
    0 references
    0 references
    11 June 2021
    0 references
    matching cut
    0 references
    bounded degree cut
    0 references
    parameterized complexity
    0 references
    FPT algorithm
    0 references
    polynomial kernel
    0 references
    distance to cluster
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers