Author:
Talmon Nimrod,Hartung Sepp
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference26 articles.
1. Edge-contraction problems;Asano;J. Comput. Syst. Sci.,1983
2. Cristina Bazgan, Andre Nichterlein, Parameterized inapproximability of degree anonymization, in: Proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC '14, LNCS, Springer.
3. Parameterized complexity of three edge contraction problems with degree constraints;Belmonte;Acta Inform.,2014
4. The complexity of finding a large subgraph under anonymity constraints;Bredereck,2013
5. The complexity of degree anonymization by vertex addition;Bredereck;Theor. Comput. Sci.,2015
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献