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...

Descrición completa

Gardado en:
Detalles Bibliográficos
Main Authors: Alexander V. Korostil, Andrei V. Nikolaev
Formato: Artigo
Idioma:Inglês
Publicado: Yaroslavl State University 2021-03-01
Series:Modelirovanie i Analiz Informacionnyh Sistem
Assuntos:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Acceso en liña:https://www.mais-journal.ru/jour/article/view/1469
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!

Títulos similares