On an Algorithm of Frieze
Howard Kleiman
math.COarXiv:math/0102155
Abstract
The algorithm reduces the running time of an algorithm of Frieze from O(n1.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.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell