"On the computational complexities of three problems related to a privacy ..."

Tanima Chatterjee et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2018.12.013

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/ChatterjeeDMSY19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ChatterjeeDMSY19
Tanima Chatterjee, Bhaskar DasGupta, Nasim Mobasheri, Venkatkumar Srinivasan, Ismael González Yero:
On the computational complexities of three problems related to a privacy measure for large networks under active attack. Theor. Comput. Sci. 775: 53-67 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.