15 citations · 17 across the 9 of their papers we have counts for
Showing 2002 · math.COShow all
3 papers · 2 filters
math.CO2002
The Floyd-Warshall Algorithm, the AP and the TSP III
Howard Kleiman
We clarify the exposition of Phases 2 and 3a in "The Floyd-Warshall Algorithm, the AP and the TSP". We also improve and simplify theorem 3.6 . In line with clarifying the expositio…
math.CO2002
Obtaining hamilton cicuits in graphs and digraphs
Howard Kleiman
This paper improves algorithms given in math.CO/0012036. Although the graph (digraph) becomes non-random as the algorithm proceeds, the probability for success stays the same. We a…
math.CO2002
H-admissible permutations and the HCP
Howard Kleiman
This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in pol…