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

02/18/2019

∙

by   Cícero A. de Lima, et al.

∙

0

∙

share

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 is a NP-Complete problem. In this paper, a novel algorithm for hamiltonian sequence problem is proposed. The proposed algorithm assumes that G have potential forbidden minors that prevent a potential hamiltonian sequence P 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 pass through G constructing a potential hamiltonian sequence P with the aim of degenerating these potential forbidden minors. The algorithm, in turn, try to reconstruct P in second phrase by using a goal-oriented approach.