Algorithms for efficiently computing structural anonymity in complex networks

DOI10.1145/3604908MaRDI QIDQ6579773FDOQ6579773

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

• Practical graph isomorphism. II.
• Elements of statistical disclosure control
• Emergence of Scaling in Random Networks
• Title not available (Why is that?)
• Collective dynamics of `small-world' networks
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• Network science. With Márton Pósfai

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)