Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem

Christophe Paul, Anthony Perez, Stéphan Thomassé. Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. In Filip Murlak, Piotr Sankowski, editors, Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. Volume 6907 of Lecture Notes in Computer Science, pages 497-507, Springer, 2011. [doi]

Bibliographies