can be eliminated, so the search gets continually smaller. The algorithm also divides the graph into components that can be solved separately, greatly reducing the search size. In practice, this algorithm is still the fastest.

Dynamic programming

Also, a dynamic programming algorithm of Bellman, Held, and Karp can be used to solve the problem in time O(n² 2ⁿ). In this method, one determines, for each set S of vertices

1.Previous
3.Next