AI Chat AI Image Generator AI Video Text to Speech

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

03/13/2019

∙

by Mithilesh Kumar, et al.

∙

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

READ FULL TEXT

page 1

page 2

research

∙ 09/10/2018

Optimal Partition of a Tree with Social Distance

We study the problem to find a partition of graph G with maximum social ...

0 Masahiro Okubo, et al. ∙

research

∙ 12/08/2021

The Complexity of the Hausdorff Distance

We investigate the computational complexity of computing the Hausdorff d...

0 Paul Jungeblut, et al. ∙

research

∙ 03/20/2020

New heuristics for burning graphs

The concept of graph burning and burning number (bn(G)) of a graph G was...

0 Zahra Rezai Farokh, et al. ∙

research

∙ 04/05/2019

Automating Resolution is NP-Hard

We show that the problem of finding a Resolution refutation that is at m...

0 Albert Atserias, et al. ∙

research

∙ 05/08/2019

Switches in Eulerian graphs

We show that the graph transformation problem of turning a simple graph ...

0 Ahad N. Zehmakan, et al. ∙

research

∙ 08/12/2019

Link Crossing Number is NP-hard

We show that determining the crossing number of a link is NP-hard. For s...

0 Arnaud de Mesmay, et al. ∙

research

∙ 08/27/2021

On the Upward Book Thickness Problem: Combinatorial and Complexity Results

A long-standing conjecture by Heath, Pemmaraju, and Trenk states that th...

0 Sujoy Bhore, et al. ∙

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

Related Research

Optimal Partition of a Tree with Social Distance

The Complexity of the Hausdorff Distance

New heuristics for burning graphs

Automating Resolution is NP-Hard

Switches in Eulerian graphs

Link Crossing Number is NP-hard

On the Upward Book Thickness Problem: Combinatorial and Complexity Results