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

Полное описание

Сохранить в:
Библиографические подробности
Главные авторы: Alexander V. Korostil, Andrei V. Nikolaev
Формат: Artigo
Язык:Inglês
Опубликовано: Yaroslavl State University 2021-03-01
Серии:Modelirovanie i Analiz Informacionnyh Sistem
Предметы:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Online-ссылка:https://www.mais-journal.ru/jour/article/view/1469
Метки: Добавить метку
Нет меток, Требуется 1-ая метка записи!

Схожие документы