Algorithms for efficiently computing structural anonymity in complex networks

DOI10.1145/3604908MaRDI QIDQ6579773zbMATH OpenFDO

Authors Rachel G. de Jong, Mark P. J. van der Loo, Frank W. Takes

Publication date 26 July 2024

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

zbMATH Keywords

graph algorithmscomplex networksprivacyanonymity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• Collective dynamics of `small-world' networks
• Elements of statistical disclosure control
• Emergence of Scaling in Random Networks
• Network science. With Márton Pósfai
• Practical graph isomorphism. II.

This page was built for publication: Algorithms for efficiently computing structural anonymity in complex networks

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