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
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.12.013 / 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
29 May 2019
0 references
privacy measure
0 references
social networks
0 references
active attack
0 references
computational complexity
0 references
