Greetings.
As we know, inside a SCT, there exists a Hamiltonian path, starting from each node.
What is an efficient way of finding a Hamiltonian path inside of a Strongly Connected Tournament?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Finding a Hamiltonian path in a Strongly Connected Tournament
Greetings.
As we know, inside a SCT, there exists a Hamiltonian path, starting from each node.
What is an efficient way of finding a Hamiltonian path inside of a Strongly Connected Tournament?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|