On the complexity of \(k\)-metric antidimension problem and the size of \(k\)-antiresolving sets in random graphs

DOI10.1007/978-3-319-62389-4_46zbMath1434.68373OpenAlexW2728702993MaRDI QIDQ2412436

Congsong Zhang, Yong Gao

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_46

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Privacy of data (68P27)

Related Items (3)

On the computational complexities of three problems related to a privacy measure for large networks under active attack ⋮ \((k, l)\)-anonymity in wheel-related social graphs measured on the base of \(k\)-metric antidimension ⋮ K-metric antidimension of some generalized Petersen graphs

This page was built for publication: On the complexity of \(k\)-metric antidimension problem and the size of \(k\)-antiresolving sets in random graphs