most citedFaster Lattice Enumeration

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2019

2-CLUB is NP-hard for distance to 2-club cluster graphs

Mithilesh Kumar

We show that 2-CLUB is NP-hard for distance to 2-club cluster graphs.