Authors: Grzegorz Ileczko
This arcle is a short demonstraon of computaonal possibilies of the extreme effecve algorithm for the Hamilton problem. In fact, the algorithm can fast solve a few similar problems, well-known in literature as: Hamilton path Hamilton cycle and Hamilton longest path Hamilton longest cycle
Comments: 14 Pages.
[v1] 2015-05-29 01:56:46
Unique-IP document downloads: 67 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.