Pages that link to "Item:Q2419112"
From MaRDI portal
The following pages link to On the computational complexities of three problems related to a privacy measure for large networks under active attack (Q2419112):
Displaying 5 items.
- Improving the characterization of P-stability for applications in network privacy (Q277631) (← links)
- Private computation: \(k\)-connected versus 1-connected networks (Q850501) (← links)
- \((k, l)\)-anonymity in wheel-related social graphs measured on the base of \(k\)-metric antidimension (Q2052120) (← links)
- Analysis of centrality measures under differential privacy models (Q2246027) (← links)
- K-metric antidimension of some generalized Petersen graphs (Q5863918) (← links)