Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference30 articles.
1. Böcker, S., Damaschke, P.: Even faster parameterized cluster deletion and cluster editing. Inf. Process. Lett. 111(14), 717–721 (2011)
2. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28(1), 277–305 (2014)
3. Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570–4578 (2011)
4. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey, vol. 3. SIAM, New Delhi (1999)
5. Bulteau, L., Grüttemeier, N., Komusiewicz, C., Sorge, M.: Your rugby mates don’t need to know your colleagues: triadic closure with edge colors. In: Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC’19). Lecture Notes in Computer Science, vol. 11485, pp. 99–111. Springer, Berlin (2019)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献