Grzegorz Ileczko
Abstract
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
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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
Key concepts: Hamiltonian path, Path (computing), NP-complete, Mathematics, Algorithm, Combinatorics, Mathematical optimization, Computer science