Author:
Bredereck Robert,Hartung Sepp,Nichterlein André,Woeginger Gerhard J.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509 (1999)
2. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications, vol. 3. SIAM (1999)
3. Chester, S., Kapron, B., Srivastava, G., Venkatesh, S.: Complexity of social network anonymization. Social Network Analysis and Mining, 1–16 (2012a)
4. Chester, S., Kapron, B.M., Ramesh, G., Srivastava, G., Thomo, A., Venkatesh, S.: Why Waldo befriended the dummy? k-anonymization of social networks with pseudo-nodes. In: Social Network Analysis and Mining, pp. 1–19 (2012b) ISSN 1869-5450
5. Chvátal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. Annals of Discrete Mathematics 1, 145–162 (1977)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献