Abstract
We study the parameterized complexity of the s-CLUB CLUSTER EDGE DELETION (s-CLUB CLUSTER VERTEX DELETION) problem: Given a graph G and two integers s......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
