Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563)

From MaRDI portal
Revision as of 18:44, 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
Tight bounds for parameterized complexity of cluster editing with a small number of clusters
scientific article

    Statements

    Tight bounds for parameterized complexity of cluster editing with a small number of clusters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2014
    0 references
    cluster editing
    0 references
    correlation clustering
    0 references
    parameterized complexity
    0 references
    subexponential-time algorithms
    0 references
    exponential-time hypothesis
    0 references

    Identifiers