載入...
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...
Na minha lista:
| Main Authors: | , |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Yaroslavl State University
2021-03-01
|
| 叢編: | Modelirovanie i Analiz Informacionnyh Sistem |
| 主題: | |
| 在線閱讀: | https://www.mais-journal.ru/jour/article/view/1469 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|