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

Disgrifiad llawn

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Prif Awduron: Alexander V. Korostil, Andrei V. Nikolaev
Fformat: Artigo
Iaith:Inglês
Cyhoeddwyd: Yaroslavl State University 2021-03-01
Cyfres:Modelirovanie i Analiz Informacionnyh Sistem
Pynciau:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Mynediad Ar-lein:https://www.mais-journal.ru/jour/article/view/1469
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!

Eitemau Tebyg