作 者:
;
;
机构地区:
中南大学数学与统计学院
出 处:
《贵州工业大学学报(自然科学版)》
2003年第6期32-34,41,共4页
摘 要:
计算理想的约化Grobner基,得到了一种录求最佳信道数及最佳信道分配方案的方法;即如果图M是k-可分配的,但当1≤l
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.
关 键 词:
无线电信道分配
基法
无向图
弱
零点定理
领 域:
[电子电信]
[电子电信]
[理学]
[理学]