2-CLUB is NP-hard for distance to 2-club cluster graphs
classification
💻 cs.CC
keywords
clubclusterdistancegraphsnp-hard
read the original abstract
We show that 2-CLUB is NP-hard for distance to 2-club cluster graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.