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

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Asıl Yazarlar: Alexander V. Korostil, Andrei V. Nikolaev
Materyal Türü: Artigo
Dil:Inglês
Baskı/Yayın Bilgisi: Yaroslavl State University 2021-03-01
Seri Bilgileri:Modelirovanie i Analiz Informacionnyh Sistem
Konular:
hamiltonian decomposition
traveling salesperson polytope
1-skeleton
vertex adjacency
backtracking
Online Erişim:https://www.mais-journal.ru/jour/article/view/1469
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Benzer Materyaller