Editing graphs into disjoint unions of dense clusters (Q652530)

From MaRDI portal
Revision as of 16:59, 3 July 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
Editing graphs into disjoint unions of dense clusters
scientific article

    Statements

    Editing graphs into disjoint unions of dense clusters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 December 2011
    0 references
    cluster editing
    0 references
    parameterized complexity
    0 references
    data reduction
    0 references
    forbidden subgraph characterization
    0 references
    NP-hardness
    0 references
    clique relaxations
    0 references

    Identifiers