Finding a Hamiltonian path in a Strongly Connected Tournament

Правка en3, от Marine7, 2018-04-21 21:40:22

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)