1) clique partition
团划分
1.
A heuristic method aimed at functional unit allocation is also presented to improve the clique partition algorithm.
使用团划分算法在该模型上进行功能单元分配,同时提出一种针对功能单元分配问题的团划分启发式方法。
2.
This paper proposes an approximation algorithm for this problem based on the approximation clique partition method.
基于团划分方法构造了该问题的多项式时间近似算法,通过模拟实验进行了验证,和最大宽度优先(LWF)算法相比,该算法花费时间较长,近似比性能要好。
2) groups division
组团划分
1.
Thoughts on residential community planning methods caused by groups division;
由组团划分引发的住区规划方法的思考
3) clique partition number
团划分数
1.
This paper discusses clique covering number and clique partition number on the line graph and total graph of n Sun graph.
主要讨论ｎ－太阳图的线图及全图的团覆盖数和团划分数，得出了ｎ－太阳图的线图及全图的覆团盖数与团划分数相等且都是ｎ的倍数。
2.
In this paper, after discussing the clique covering num be r and clique partition number on the graph of the Petersen generalizing graph- n cycle intermediate spoke graph, we obtain the result that the clique cover ing number and clique partition number of the graph are equal.
本文主要讨论 Petersen图的一类推广图—— n圈中辐图的团覆盖数和团划分数 ,由此得出该图的团覆盖数和团划分数相等的结论 ,同时给出了其在不同情况下的计算公式 。
5) k-clique partition
k团分划
1.
k-clique partition of complete k-uniform hypergraphs;
完全k一致超图的k团分划
6) minimum clique partition
最小团划分
1.
According to the feedback from the receivers,the retransmission problem based on network coding was modeled as a graph,and the sender s retransmission strategy as a minimum clique partition problem of the graph.
根据从接收节点得到的反馈信息,提出了一个图模型来刻画基于网络编码的重传问题,并将发送节点的重传策略模型化为图中的最小团划分。
补充资料：团头团脑
1.形容体形圆胖。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条