The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh. The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica, 68(2):504-530, 2014. [doi]

No reviews for this publication, yet.