Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Swart, N. R."'
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_
Externí odkaz:
http://arxiv.org/abs/1611.01710
Autor:
Swart, N. R., Nathan, A.
Publikováno v:
Sensors and Actuators A: Physical; 1994, Vol. 43 Issue: 1 p3-3, 1p
