E. R. Swart

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P , such that p u,i = 1 if and only if the i th arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance(More)
  • 1