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

Descrizione completa

Salvato in:
Dettagli Bibliografici
Autori principali: Alexander V. Korostil, Andrei V. Nikolaev
Natura: Artigo
Lingua:Inglês
Pubblicazione: Yaroslavl State University 2021-03-01
Serie:Modelirovanie i Analiz Informacionnyh Sistem
Soggetti:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Accesso online:https://www.mais-journal.ru/jour/article/view/1469
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !

Documenti analoghi