Expanding graphs and the average-case analysis of algorithms for matchings and related problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Average-case analysis of algorithms for matchings and related problems
Journal of the ACM (JACM)
Robust non-interactive zero-knowledge watermarking scheme against cheating prover
MM&Sec '05 Proceedings of the 7th workshop on Multimedia and security
Proceedings of the 4th Annual International Conference on Wireless Internet
Computational complexity of the hamiltonian cycle problem in dense hypergraphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Hi-index | 0.00 |
This paper describes a polynomial time algorithm HAM that searches for Hamilton cycles in undirected graphs. On a random graph its asymptotic probability of success is that of the existence of such a cycle. If all graphs with n vertices are considered equally likely, then using dynamic programming on failure leads to an algorithm with polynomial expected time. Finally, it is used in an algorithm for solving the symmetric bottleneck travelling salesman problem with probability tending to 1, as n tends to ∞.