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

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile Nagusiak: Alexander V. Korostil, Andrei V. Nikolaev
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: Yaroslavl State University 2021-03-01
Saila:Modelirovanie i Analiz Informacionnyh Sistem
Gaiak:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Sarrera elektronikoa:https://www.mais-journal.ru/jour/article/view/1469
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!

Antzeko izenburuak