1) A'da'm self complement directional circular networks
A'da'm自补有向环形网络
1.
Some conclusions for the A′da′m self complement directional circular networks have been given.
近年来中外图论学者提出了许多关于环形网络的研究成果 ,其中有些是关于 A′da′m自补有向环形网络的 。
2) directed acyclic network
有向无环网络
1.
A universal algorithm for detecting all simple paths between any two nodes in weighted directed acyclic network was presented.
提出了一种有向无环网络中任意两节点间所有简单路径的通用搜索算法。
3) Active on Edges Network
有向无环网络图
4) directed double loop networks
有向双环网络
1.
Eight new 2-tight optimal infinite families of directed double loop networks;
8族新的2-紧优的有向双环网络无限族
2.
Three new infinite families of directed double loop networks which not containing tight optimal and almost tight optimal are given in this paper.
给出了3族新的不含紧优与几乎紧优的有向双环网络。
5) directed networks
有向网络
1.
Based on non-uniform swarm,a dynamic model in directed networks was constructed.
用图论模型表示智能体之间的相互作用或通信关系,基于异构的智能群体,建立了动态的有向网络模型。
2.
The deformed Floyd algorithm of the shortest path between the two nodes in the directed networks is presented and the complexity of time shares the same rank with Floyd algorithm,but it reveals an object image and provides an easy way to programme.
给出了求有向网络中每对顶点间最短路径的变形Ｆｌｏｙｄ算法，其时间复杂度与Ｆｌｏｙｄ算法同量级，形象直观且易于编写程
3.
So far, few of researches have focused on the theory and application of directed networks, and most of them treated directed networks as a na?ve extension of undirected networks .
迄今为止,在复杂网络的研究中,对有向网络的系统的研究还很少,许多学者认为有向网络只是无向网络的自然扩充,他们把本属于有向网络的问题都简化抽象为无向网络问题。
6) Directed network
有向网络
1.
May be studied as the weighted directed network system.
具有网络通讯结构的信息系统在以Petri网为模型进行描述时可以归结为两类加权有向网络系统的研究,文章首先将Petri网模型描述下的信息系统结构分解为由两类性质不同的系统要素构成的有向网络图,并对这两类有向网络图引进了加权核和加权核度的概念和定义。
2.
The two-way search algorithm for finding the shortest path between two vertexes in a directed network in this paper is proposed.
提出了一种求解有向网络上两顶点间最短路径的双向搜索算法，经理论证明和实际应用，该方法较原Ｄｉｊｋｔｒａ算法可平均提高８倍的计算效
补充资料：环形
圆环。也指这样的形状。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条