1 resultado para implicit enumeration

em Digital Commons - Michigan Tech


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A k-cycle decomposition of order n is a partition of the edges of the complete graph on n vertices into k-cycles. In this report a backtracking algorithm is developed to count the number of inequivalent k-cycle decompositions of order n.