Publish in OALib Journal
APC: Only $99
We single out the polygonal paths
of nodd -1 order that solve each
of the different longest
non-cyclic Euclidean Hamiltonian path problems in networks by an
arithmetic algorithm. As by product, the procedure determines the winding index
of cyclic Hamiltonian polygonals on the vertices of a regular polygon.