Greetings.
As we know, inside a SCT, there exists a Hamiltonian path, starting from every node.
What is an efficient way of finding a Hamiltonian path inside of a Strongly Connected Tournament?
Finding a Hamiltonian path in a Strongly Connected Tournament
Greetings.
As we know, inside a SCT, there exists a Hamiltonian path, starting from every node.
What is an efficient way of finding a Hamiltonian path inside of a Strongly Connected Tournament?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en4 |
|
Marine7 | 2018-04-21 23:57:38 | 7 | Tiny change: 'ing from every node.\n\n' -> 'ing from each node.\n\n' | |
| en3 |
|
Marine7 | 2018-04-21 21:40:22 | 7 | Tiny change: 'ing from each node.\n\n' -> 'ing from every node.\n\n' | |
| en2 |
|
Marine7 | 2018-04-21 20:43:35 | 7 | Tiny change: 'ing from every node.\n\n' -> 'ing from each node.\n\n' | |
| en1 |
|
Marine7 | 2018-04-21 13:00:20 | 260 | Initial revision (published) |
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
