Mar 1, 2016 · We present a correct proof. Furthermore, we prove that the problem remains NP-complete even when restricted to graphs whose density is bounded ...
In this paper, we provide a different proof of the NP-hardness of Switch-Few-Edges, based on a reduction from a restricted version of Max-Cut. Furthermore, we ...
Nov 21, 2024 · Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, ...
Dec 15, 2024 · Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, ...
Mar 1, 2016 · Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, ...
People also ask
What is the smallest number of edges a graph can have?
What is the number of edges of a simple graph?
TL;DR: This work considers the computational complexity of deciding if an input graph can be switched into a graph having a desired graph property, and shows ...
Vít Jelínek, Eva Jelínková, Jan Kratochvíl: On the hardness of switching to a small number of edges. CoRR abs/1603.00254 (2016).
On the Hardness of Switching to a Small Number of Edges. Authors. Vít Jelínek · Eva Jelínková · Jan Kratochvíl. Publication date: 31 December 2015.
Mar 1, 2016 · Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, ...
We study the hardness of approximating the chromatic number when the input graph is k-colorable for some fixed k≥3. Our main result is that it is NP-hard to ...