I am not expertise in graph theory. So have to ask this question here. The term "good" means that the algorithms should be efficient for general undirected simple connected graphs with a higher success probability. I also read the question Efficient Hamiltonian cycle algorithms for graph classe...