Pairing Round-robin tournament
The problem I solved yesterday seems to be pairings in Round-robin tournament.
It is called “1-factorization of a complete graph” in graph theory. (according to wikipedia :p)
It seems that it has a O(n)
solution.
The problem I solved yesterday seems to be pairings in Round-robin tournament.
It is called “1-factorization of a complete graph” in graph theory. (according to wikipedia :p)
It seems that it has a O(n)
solution.