Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs

Authors:
Vladimir Grebinski;Gregory Kucherov
Affiliations:
-;-
Venue:
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Year:
1997

Citing 0
Cited 4

On the Power of Additive Combinatorial Search Model

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Learning a hidden graph using O( logn) queries per edge

Journal of Computer and System Sciences
Optimal query complexity bounds for finding graphs

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Learning a hidden hypergraph

COLT'05 Proceedings of the 18th annual conference on Learning Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies four combinatorial search models of reconstructing a fixed unknown Hamiltonian cycle in the complete graph by means of queries about subgraphs. For each model, an efficient algorithm is proposed that matches asymptotically the information-theoretic lower bound. The problem is motivated by an application to genome physical mapping.