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_46MaRDI QIDQ2412436zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• k-metric antidimension: a privacy measure for social graphs
• \((k, l)\)-anonymity in wheel-related social graphs measured on the base of \(k\)-metric antidimension
• On the computational complexities of three problems related to a privacy measure for large networks under active attack
• A refined complexity analysis of degree anonymization in graphs
• A refined complexity analysis of degree anonymization in graphs

Cited in

(3)

• \((k, l)\)-anonymity in wheel-related social graphs measured on the base of \(k\)-metric antidimension
• On the computational complexities of three problems related to a privacy measure for large networks under active attack
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412436)