无线电信道分配问题的Gr(?)bner基法

Grobner-basis Algorithm for the Wireless Optimum Channel Value Problem

计算理想的约化Grobner基,得到了一种录求最佳信道数及最佳信道分配方案的方法;即如果图M是k-可分配的,但当1≤l<k时,图M不是l-可分配的,那么k即为最佳信道数;通过计算理想的约化Grobner基G,得到最佳信道分配方案。

In this paper, the author has obtained an algorithm for pursuing optimum channel value and optimum channel distributing plan by means of computing reduced Grobner-basis of ideal. That is,if the diagram M is a k-assignable and the diagram M is not l-assignable when 1≤l< k ,then k is an optimum channel value. The optimal channel allotment project can be obtained by calculating reduced Grobner-basis.