\(k\)-metric antidimension: a privacy measure for social graphs
From MaRDI portal
Publication:1750516
DOI10.1016/j.ins.2015.08.048zbMath1388.91138arXiv1408.2154OpenAlexW1537670233MaRDI QIDQ1750516
Rolando Trujillo-Rasua, Ismael González Yero
Publication date: 22 May 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2154
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Cryptography (94A60)
Related Items (17)
The equidistant dimension of graphs ⋮ Incentive mechanism for cooperative authentication: an evolutionary game approach ⋮ Minimum partition of an \(r\)-independence system ⋮ Partition dimension of rooted product graphs ⋮ On the computational complexities of three problems related to a privacy measure for large networks under active attack ⋮ Further new results on strong resolving partitions for graphs ⋮ Partition dimension of certain classes of series parallel graphs ⋮ On mixed metric dimension in subdivision, middle, and total graphs ⋮ Graphs whose mixed metric dimension is equal to their order ⋮ Co-utile disclosure of private data in social networks ⋮ On graphs with the maximum edge metric dimension ⋮ Mixed metric dimension of graphs ⋮ Distance-based vertex identification in graphs: the outer multiset dimension ⋮ Edge metric dimensions via hierarchical product and integer linear programming ⋮ \((k, l)\)-anonymity in wheel-related social graphs measured on the base of \(k\)-metric antidimension ⋮ On some resolving partitions for the lexicographic product of two graphs ⋮ K-metric antidimension of some generalized Petersen graphs
Cites Work
This page was built for publication: \(k\)-metric antidimension: a privacy measure for social graphs
