定义3.4 一个结点的度(degree of a node)：设图G=(V,E)，v∈V，结点v的度为与其相关联 的边的个数，记作d(v)。即d(v)=|{e∈E|e=(u,v),u∈V}| + |{e∈E|e=(v,u),u∈V}|。
基于12个网页-相关网页
Using the concept of correlation degree between nodes we build a local world of each node in the network, and the size of the local-world increases with time.
应用节点间相关度的概念来确定每一新加入节点的局域世界，并定义局域世界的规模是动态增加的。
PELBR defines a metric for routing known as the degree of nodal activity that defines the communication-load of a node.
PELBR定义了一种称为节点活动度的标准，节点活动度定义了节点的通信负载。
Thus, the multicast capability of each node is represented in this paper by a degree-constraint.
为此，采用度约束来表示每个节点的多播能力，提出了一种有度约束的分布式多播路由算法。
应用推荐