1) extended digraph
扩张有向图
2) Extended Directed Graph
扩展有向图
1.
The Research and Implementation of a Product Parametric Model Based on the Extended Directed Graph;
基于扩展有向图的产品参数化模型的研究与实现
3) extended directed net graph
扩展有向网络图
1.
This method uses an extended directed net graph to describe the workflow process in order to ensure the validity of model.
该方法对传统的有向网络图进行扩展并以此来描述工作流过程,确定模型的有效性;进一步将扩展有向网络图转换成工作流网模型,应用Petri网技术分析该模型的冲突结构,以确保工作流过程的逻辑合理性。
4) spanning sub-graph
扩张子图
5) graph extension
图的扩张
1.
It turns out that they are in fact a class of graph extension problems which are also proposed from a great variety of topics, such as graph minors, VLSI designs, interconnection networks and even molecular biology.
本文从图论观点着重讨论两种统一途径：图的标号及图的扩张。
补充资料：极大扩张和极小扩张
极大扩张和极小扩张
maximal and minimal extensions
极大扩张和极小扩张匡.习的司出目.公油抽lex妇心.旧;MaKcl.Ma刀‘.oe H Mll.”M田.妇oe PaC山一Pe皿朋] 一个对称算子(s笋nr贺苗c opemtor)A的极大扩张和极小扩张分别是算子牙(A的闭包，(见闭算子(cfo“月。详mtor”)和A’(A的伴随，见伴随算子(呐。int opera.tor)).A的所有闭对称扩张都出现在它们之间.极大扩张和极小扩张相等等价于A的自伴性(见自伴算子(义休.adjoint operator))，并且是自伴扩张唯一性的必要和充分条件.A.H.J’Ior朋oB，B.c.lll户、MaR撰
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条