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

**Authors:** Mithilesh Kumar

arXiv: 1903.05425 · 2019-03-14

## TL;DR

This paper proves that determining the 2-CLUB problem remains NP-hard even when restricted to graphs close to 2-club cluster graphs, highlighting computational complexity challenges.

## Contribution

It establishes the NP-hardness of 2-CLUB for graphs with small distance to 2-club cluster graphs, a previously unknown complexity result.

## Key findings

- 2-CLUB is NP-hard for graphs close to 2-club cluster graphs
- Complexity persists even with structural graph restrictions
- Highlights computational difficulty in specialized graph classes

## Abstract

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

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1903.05425/full.md

## Figures

1 figure with captions in the complete paper: https://tomesphere.com/paper/1903.05425/full.md

## References

1 references — full list in the complete paper: https://tomesphere.com/paper/1903.05425/full.md

---
Source: https://tomesphere.com/paper/1903.05425