Open access
Jul 2026
A Novel Edge-Efficiency-Based Algorithm for Hamiltonian Cycle and Path Detection in Graphs
The E2 Algorithm for constructing the Hamiltonian cycle in an arbitrary graph without edges’ weights is proposed and whether some general graphs are Hamiltonian is shown, to prove the correctness of the method.
Fatih Okumuş, A. Karadoğan
· Fırat Üniversitesi Mühendisl... · 0 citations