A refined complexity analysis of degree anonymization in graphs (Q2347809): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Achieving anonymity via clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Inapproximability of Degree Anonymization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymizing binary and small tables is hard to approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of \(k\)-anonymity: hardness and tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding a Large Subgraph under Anonymity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Degree Anonymization by Vertex Addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of homogeneity on the computational complexity of combinatorial data anonymization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of anonymizing data by suppressing entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms in computational molecular biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Races in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing graphs to satisfy degree constraints: a parameterized approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric median tree. --- A new model for building consensus trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY / rank
 
Normal rank

Latest revision as of 04:22, 10 July 2024

scientific article
Language Label Description Also known as
English
A refined complexity analysis of degree anonymization in graphs
scientific article

    Statements

    A refined complexity analysis of degree anonymization in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 June 2015
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    heuristics
    0 references
    \(f\)-factors
    0 references
    data privacy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers