Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph

We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson polytopes is an NP-complete problem. On the other hand, a suf...

Descripció completa

Guardat en:
Dades bibliogràfiques
Autors principals: Alexander V. Korostil, Andrei V. Nikolaev
Format: Artigo
Idioma:Inglês
Publicat: Yaroslavl State University 2021-03-01
Col·lecció:Modelirovanie i Analiz Informacionnyh Sistem
Matèries:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Accés en línia:https://www.mais-journal.ru/jour/article/view/1469
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars