Using community structure to control information sharing in online social networks, Computer Communications, vol.41, pp.11-21, 2014. ,
Introduction to Algorithms , chapter 27, p.581, 1990. ,
A taxonomy of privacypreserving record linkage techniques, Information Systems, vol.38, p.946969, 2013. ,
Maximal flow through a network, Journal canadien de math??matiques, vol.8, issue.0, pp.399-404, 1956. ,
DOI : 10.4153/CJM-1956-045-5
Escaping the big brother: An empirical study on factors influencing identification and information leakage on the web, Journal of Information Science, vol.40, issue.2, pp.180-197, 2014. ,
Originator control in usage control, Proceedings of the 3rd International Workshop on Policies for Distributed Systems and Networks, pp.60-66, 2002. ,
Information-sharing in social networks, Games and Economic Behavior, vol.82, pp.702-716, 2013. ,
Global min-cuts in rnc, and other ramifications of a simple mincut algorithm, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.21-30, 1993. ,
A new approach to the minimum cut problem, Journal of the ACM, vol.43, issue.4, pp.601-604, 1996. ,
DOI : 10.1145/234533.234534
URL : http://drona.csa.iisc.ernet.in/~kavitha/p601-karger.pdf
SNAP Datasets: Stanford large network dataset collection, 2014. ,
Anonymization of centralized and distributed social networks by sequential clustering, IEEE Transactions on Knowledge & Data Engineering, vol.25, issue.2, pp.311-324, 2013. ,