1 citations · 2 across the 12 of their papers we have counts for
1 paper · 2 filters
Mithilesh Kumar
We show that 2-CLUB is NP-hard for distance to 2-club cluster graphs.