On an Algorithm of Frieze
Abstract
The algorithm reduces the running time of an algorithm of Frieze from O(n^{1.5)) to O(n^(4/3 + o)). It also introduces the concept of admissible permutations that is used in algorithms for obtaining solutions to the AP and the TSP.
 Publication:

arXiv Mathematics eprints
 Pub Date:
 February 2001
 arXiv:
 arXiv:math/0102155
 Bibcode:
 2001math......2155K
 Keywords:

 Mathematics  Combinatorics;
 05C85
 EPrint:
 This is a very simple version of the original algorithm together with a detailed illustration of it in Example 2.1 . It is the second chapter of a book  "P = NP? Admissible Permutations and the HCP, the AP, and the TSP"  nearly completed. This version contains two figures