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

Volledige beschrijving

Bewaard in:
Bibliografische gegevens
Hoofdauteurs: Alexander V. Korostil, Andrei V. Nikolaev
Formaat: Artigo
Taal:Inglês
Gepubliceerd in: Yaroslavl State University 2021-03-01
Reeks:Modelirovanie i Analiz Informacionnyh Sistem
Onderwerpen:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Online toegang:https://www.mais-journal.ru/jour/article/view/1469
Tags: Voeg label toe
Geen labels, Wees de eerste die dit record labelt!

Gelijkaardige items