On the computational complexities of three problems related to a privacy measure for large networks under active attack (Q2419112): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2018.12.013 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2904985925 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1607.01438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy, additional information and communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On communication protocols that compute almost privately / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-metric antidimension: a privacy measure for social graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-metric antidimension problem and the size of \(k\)-antiresolving sets in random graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128736021 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2018.12.013 / rank
 
Normal rank

Latest revision as of 12:42, 18 December 2024

scientific article
Language Label Description Also known as
English
On the computational complexities of three problems related to a privacy measure for large networks under active attack
scientific article

    Statements

    On the computational complexities of three problems related to a privacy measure for large networks under active attack (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2019
    0 references
    privacy measure
    0 references
    social networks
    0 references
    active attack
    0 references
    computational complexity
    0 references

    Identifiers

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