Inverse HAMILTONIAN CYCLE and inverse 3DIMENSIONAL MATCHING are coNP-complete

被引：0
|
作者：
Hempel, Harald [1 ]
Krueger, Michael [1 ]
机构：
[1] Univ Jena, Inst Informat, D-07743 Jena, Thuringia, Germany
来源：
THEORETICAL COMPUTER SCIENCE | 2012年 / 426卷
关键词：
Computational complexity; CoNP-completeness; Inverse problems; HAMILTONIAN CYCLE; 3DIMENSIONAL MATCHING;
D O I：
10.1016/j.tcs.2011.08.020
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we show that the inverse problems of HAMILTONIAN CYCLE and 3DIMENSIONAL MATCHING are coNP-complete. This completes the study of inverse problems of the six natural NP-complete problems from Garey and Johnson (1979) [2] and answers an open question from Chen (2003) [1]. We show that the coNP-completeness of the inverse problem of HAMILTONIAN CYCLE holds for undirected as well as for directed graphs. (C) 2012 Published by Elsevier B.V.
引用
收藏
页码：49 / 65
页数：17
相关论文
共 50 条
12345