Author:
Bazgan Cristina,Cazals Pierre,Chlebíková Janka
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. Finding large degree-anonymous subgraphs is hard;Bazgan;Theor. Comput. Sci.,2016
2. The complexity of degree anonymization by vertex addition;Bredereck,2014
3. An algorithm for k-degree anonymity on large networks;Casas-Roma,2013
4. A survey of graph-modification techniques for privacy-preserving on networks;Casas-Roma;Artif. Intell. Rev.,2017
5. Rotation and jump distances between graphs;Chartrand;Discuss. Math., Graph Theory,1997
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献