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

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Alexander V. Korostil, Andrei V. Nikolaev
Format: Artigo
Langue:Inglês
Publié: Yaroslavl State University 2021-03-01
Collection:Modelirovanie i Analiz Informacionnyh Sistem
Sujets:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Accès en ligne:https://www.mais-journal.ru/jour/article/view/1469
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires