paper

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

arXiv:1903.05425

Abstract

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