Skip to content

Author

Fatih Okumuş

We have 1 of 13 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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 · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.