On an Algorithm of Frieze

Publication date 19 February 2001

Graph algorithms (graph-theoretic aspects) (05C85)

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.

This page was built for publication: On an Algorithm of Frieze

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6470941)