全部 标题 作者
Keywords: Hamiltonian path , arc-colored digraph , satisfiability problem , NP-complete
Cite this paper
Add to My Lib
In this paper we consider an approach to solve the problem of Hamiltonianpath with fixed number of color repetitions for arc-colored digraphs.Our approach is based on usage of local search algorithms tosolve a logical model for the problem.