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

03/13/2019
by   Mithilesh Kumar, et al.
0

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

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro