1) m fold n ary tree
m重n叉树
2) m_ary Tree
m叉树
4) regular m-furcating tree
正则m叉树
1.
For a regular m-furcating tree, the authors derive a recurrence formula of the number of its S(n)= {Ki: 1<i<n}-factor through analysing the relation among i,t and m of sub-furcating trees.
在正则m叉树T中,删除K2及端点关联边,通过所得子正则m叉树中分枝点、叶数和m之间内在联系,本文导出正则m叉树T的S~(m)={Ki:1≤i≤n}-因子数递归公式。
5) Regular M-crossing Tree
正则m-叉树
1.
We survey the reduction formula of characteristic polynomial of Regular M-crossing Tree and obtain which Regular M-crossing Tree become the Integral Graph condition.
本文主要是研究正则m-叉树特征多项式的递推公式,并通过其递推公式来得出正则m-叉树成为整图的条件。
6) N-ary tree
N叉树
1.
This paper proposes an efficient QoS guarantee scheme based on N-ary tree topology of an actual network.
针对实际应用中的网络拓扑结构,提出一种基于N叉树的有效QoS保证方案,该混合方案(Hybrid Scheme)结合基于指针转发的层次RSVP(HMRSVPpf)和交叉路由器(CR)发现算法。
2.
In this paper, a new random N-ary tree collision resolution algorithm of improved isolation type is used to analyze the packet collision resolution in VSAT random multiple access system.
文章提出一种新的改进隔离型随机N叉树形冲突分解算法,对VSAT随机接入多址接入系统中冲突分解进行了研究。
补充资料：叉手叉脚
1.形容参差不齐。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条