Improving the characterization of P-stability for applications in network privacy (Q277631): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2016.01.025 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.01.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2286896031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Managing and mining graph data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark concerning graphical sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the existence of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast uniform generation of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic sequences, distances and \(k\)-degree anonymity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seven criteria for integer sequences being graphic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a theorem of Erdős and Gallai / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.01.025 / rank
 
Normal rank

Latest revision as of 13:16, 9 December 2024

scientific article
Language Label Description Also known as
English
Improving the characterization of P-stability for applications in network privacy
scientific article

    Statements

    Improving the characterization of P-stability for applications in network privacy (English)
    0 references
    0 references
    0 references
    2 May 2016
    0 references
    P-stability
    0 references
    \(k\)-anonymity
    0 references
    graphic sequence
    0 references
    degree sequence
    0 references
    FPRAS
    0 references
    rapidly mixing Markov chain
    0 references
    fully polynomial-time randomized approximation scheme
    0 references

    Identifiers

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