Abstract
We study the parameterized complexity of the s-Club CLUSTER EDGE DELETION problem: Given a graph G and two integers s >= 2 and k >= 1, is it pos......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
