ロード中...
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...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Yaroslavl State University
2021-03-01
|
| シリーズ: | Modelirovanie i Analiz Informacionnyh Sistem |
| 主題: | |
| オンライン･アクセス: | https://www.mais-journal.ru/jour/article/view/1469 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|