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

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijät: Alexander V. Korostil, Andrei V. Nikolaev
Aineistotyyppi: Artigo
Kieli:Inglês
Julkaistu: Yaroslavl State University 2021-03-01
Sarja:Modelirovanie i Analiz Informacionnyh Sistem
Aiheet:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Linkit:https://www.mais-journal.ru/jour/article/view/1469
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!

Samankaltaisia teoksia