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

Cur síos iomlán

Na minha lista:
Sonraí Bibleagrafaíochta
Main Authors: Alexander V. Korostil, Andrei V. Nikolaev
Formáid: Artigo
Teanga:Inglês
Foilsithe: Yaroslavl State University 2021-03-01
Sraith:Modelirovanie i Analiz Informacionnyh Sistem
Ábhair:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Rochtain Ar Líne:https://www.mais-journal.ru/jour/article/view/1469
Clibeanna: Cuir Clib Leis
Gan Chlibeanna, Bí ar an gcéad duine leis an taifead seo a chlibeáil!

Míreanna Comhchosúla