The complexity of degree anonymization by vertex addition (Q897957)

From MaRDI portal
Revision as of 02:32, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The complexity of degree anonymization by vertex addition
scientific article

    Statements

    The complexity of degree anonymization by vertex addition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    graph modification
    0 references
    degree-constrained editing
    0 references
    NP-hardness
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractability
    0 references
    kernelization
    0 references

    Identifiers

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