1) cyclic topology
有环图
1.
For the exist content-based Publish/Subscribe(P/S) systems,general peer-to-peer topology can not support subscription covering,on the base of absorbing their design ideas,with reverse path forwarding technique and dynamic receiver update and partition strategy,a new route algorithm for content-based P/S system which supports general cyclic topology and subscription covering is proposed.
针对现有内容发布/订阅系统事件路由算法不支持有环图下订阅覆盖的问题,采用目的地动态更新与划分、逆向最短路径转发等策略,提出一种有环图下支持订阅覆盖的路由算法。
2) directed cycling graph
有向有环图
1.
In order to improve the efficiency of the algorithm for generating directed cutsets of directed cycling graph, directed cycling graph is converted to directed acyclic graph with contracted vertices by contracting edge of rings in directed cycling graph, and the algorithm for generating directed cutsets of directed acyclic graph is made to generate directed cutsets of directed cycling graph.
为了提高有向有环图有向割集生成算法的效率,通过收缩有向有环图环路中的边将有向有环图转换成带收缩顶点的有向无环图,并使得生成有向无环图有向割集的算法可以生成有向有环图的有向割集。
3) directed acyclic graph
有向无环图
1.
Graph drawing algorithm for directed acyclic graphs based on genetic algorithm;
基于遗传算法的有向无环图画图算法
2.
Study on the simplified interpretative structural modeling method for the directed acyclic graph;
面向有向无环图的简化解释结构模型(SISM)法
3.
A new GA based drawing algorithm for directed acyclic graphs
一个新的基于GA的有向无环图画图算法
4) DAG
[英][dæɡ] [美][dæɡ]
有向无环图
1.
A Real-Time Task Schedule Algorithm Based on DAG;
一种基于有向无环图的实时任务调度算法
2.
In this paper,the design progress is represented as weighted DAG,and the shortest progress under cost constraints is given by solving the shortest path on the directed graph under constraints.
本文用带权的有向无环图 (DAG)表示工程设计进度 ,并通过求解 DAG条件限制下的最短路径 ,给出费用限制下的最短工程进度。
3.
A management control mechanism based on DAG is presented,which is implemented by Java thread scheme and the concept of DAG in graph theory.
基于组件技术的密码学虚拟实验室(CVL)以Java Applet实现客户端,以Java Bean的形式开发密码算法组件,利用Java反射技术实现了系统组件的动态分析,采用XML技术实现了实验组件信息的保存,结合计算机图论中的有向无环图的概念和Java线程机制,提出了一种基于有向无环图的管理线程控制机制,较好地反映了组件之间的数据依赖关系和运行管理过程。
5) circulant digraph
有向循环图
1.
This paper, we use matric expression of circulant digraph D(n,S).
本文利用有向循环图D（n,S）的矩阵表示,讨论了D（n,S）的一些谱性质。
6) cyclic triggering graph
有环触发图
1.
Through study of the termination of rule set corresponding to cyclic triggering graph and analysis of triggering graph and activation graph, we present the concept of united formula and thereby the algorithm to determine termination of rule set corresponding to cyclic triggering graph.
针对有环触发图对应规则集的终止性问题进行了研究,通过对触发图、活化图的分析,提出了联合公式的概念,在此基础上给出了有环触发图对应规则集的终止性判定算法,该算法的提出能够更精确地判定规则集的终止性。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条