论文信息 - On Testing Hamiltonicity in the Bounded Degree Graph Model

On Testing Hamiltonicity in the Bounded Degree Graph Model

We show that testing Hamiltonicity in the bounded-degree graph model requires a linear number of queries. This refers to both the path and the cycle versions of the problem, and similar results hold also for the directed analogues. In addition, we present an alternative proof for the known fact that testing Independent Set Size (in this model) requires a linear number of queries.

Oded Goldreich

[1] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.

[2] 脳室内造影剤残存と起立性低血圧 : 日本循環器学会第25回東海・第1回北陸合同地方会総会 , 1970 .

[3] Kenji Obata,et al. A lower bound for testing 3-colorability in bounded-degree graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[4] Eugene M. Luks,et al. Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[5] GoldreichOded,et al. Property testing and its connection to learning and approximation , 1998 .

[6] Oded Goldreich. Testing Isomorphism in the Bounded-Degree Graph Model , 2019, Electron. Colloquium Comput. Complex..

[7] Michael A. Bender,et al. Testing properties of directed graphs: acyclicity and connectivity , 2002, Random Struct. Algorithms.

[8] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.

[9] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.

[10] Oded Goldreich,et al. Introduction to Property Testing , 2017 .

[11] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 2002, STOC '97.