Pages that link to "Item:Q2419112"

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 2 items.

• \((k, l)\)-anonymity in wheel-related social graphs measured on the base of \(k\)-metric antidimension (Q2052120) (← links)
• K-metric antidimension of some generalized Petersen graphs (Q5863918) (← links)