Marine7's blog

Finding a Hamiltonian path in a Strongly Connected Tournament
By Marine7, history, 7 years ago, In English

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?

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

As far as I remember, it suffices to build a path greedily, choosing always a vertex with smallest indegree from those currently reachable.

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

See here.

→ Reply