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

Cijeli opis

Spremljeno u:
Bibliografski detalji
Glavni autori: Alexander V. Korostil, Andrei V. Nikolaev
Format: Artigo
Jezik:Inglês
Izdano: Yaroslavl State University 2021-03-01
Serija:Modelirovanie i Analiz Informacionnyh Sistem
Teme:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Online pristup:https://www.mais-journal.ru/jour/article/view/1469
Oznake: Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!

Similar Items