Abstract
The problem of the great group of a figure is the famous NP-difficult problem. There exists an algorithm of solving the great group of figure or only applying to some of the special figure .There need time price is index level, and is low efficiency. It puts forward a kind of solving the minimax group partition algorithm with the most magnanimous nodes for elicitation information. This algorithm can be applied to any simple figure, and the maximum time complexity of algorithm is O(sn3).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have