On the Threshold of Intractability

@inproceedings{Drange2015OnTT,
  title={On the Threshold of Intractability},
  author={P{\aa}l Gr\on{\aa}s Drange and Markus S. Dregi and Daniel Lokshtanov and Blair D. Sullivan},
  booktitle={ESA},
  year={2015}
}
We study the computational complexity of the graph modification problems Threshold Editing and Chain Editing, adding and deleting as few edges as possible to transform the input into a threshold (or chain) graph. In this article, we show that both problems are NP-hard, resolving a conjecture by Natanzon, Shamir, and Sharan (Discrete Applied Mathematics, 113(1):109–128, 2001). On the positive side, we show the problem admits a quadratic vertex kernel. Furthermore, we give a subexponential time… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 2 times. VIEW TWEETS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Graph Classes. A Survey

Andreas Brandstädt, Van Bang Le, Jeremy P. Spinrad
SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, • 1999
View 4 Excerpts
Highly Influenced

An overview of kernelization algorithms for graph modification problems

Yunlong Liu, Jianxin Wang, Jiong Guo
Tsinghua Science and Technology, • 2014
View 7 Excerpts
Highly Influenced

Subexponential Parameterized Algorithm for Minimum Fill-In

SIAM J. Comput. • 2012
View 4 Excerpts
Highly Influenced

Graph modification problems and their applications to genomic research

R. Sharan
PhD thesis, Tel-Aviv University • 2002
View 4 Excerpts
Highly Influenced

Computing the minimum fill-in is NP-complete

Mihalis Yannakakis
SIAM Journal on Algebraic and Discrete Methods, • 1981
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…