SFCM-R: A novel algorithm for the hamiltonian sequence problem

A hamiltonian sequence is a path walk $P$ that can be a hamiltonian path or hamiltonian circuit. Determining whether such hamiltonian sequence exists in a given graph \G is a NP-Complete problem. In this paper, a novel algorithm for hamiltonian sequence problem is proposed. The proposed algorithm assumes that $G$ has potential forbidden minors that prevent a potential hamiltonian sequence $P^{\mathrm{\prime }}$ from being a hamiltonian sequence. The algorithm’s goal is to degenerate such potential forbidden minors in a two-phrase process. In first phrase, the algorithm passes through $G$ in order to construct a potential hamiltonian sequence $P^{\mathrm{\prime }}$ with the aim of degenerating these potential forbidden minors. The algorithm, in turn, tries to reconstruct $P^{\mathrm{\prime }}$ in second phrase by using a goal-oriented approach.