您要查找的是不是:
- Kautz undirected graphs 无向Kautz图
- A circ is an undirected graph having only vertices of even nonzero degree. 一广义圈是一无向图,其顶点次数都是非零偶数。
- Aim To discuss the matching equivalence of the simple undirected graph. 摘要目的讨论简单无向图的匹配等价问题。
- To enumerate all spanning trees in undirected graphs is an important problem that people frequently encounter in the analysis of network and cycle. 求无向图的生成树是在网络和回路分析中经常遇到的重要问题。
- The paper presents the method of seeking spanning trees of undirected graphs by adopting calculating trees which is realized by enumerating the difference among spanning trees. 文章描述采用计算树的方法求解无向图的生成树,这种方法是通过列举生成树之间的差别来实现的。
- Markov network is an undirected graph, while Bayesian network is a directed acyclic graph. Markov网是一个无向图 ;而 Bayesian网是一个有向无环图 .
- Function of prg () used to calculate and output undirected graph of adjacency matrix. 函数prg( )用于计算并输出无向图的邻接矩阵。
- With the motivation of the undirected graph and bipartite partition, some new estimations for singular values of a matrix were presented. 摘要利用矩阵的无向图及二部分划,给出了新的复合型矩阵奇异值估计式,改进了已有的相应结果。
- Using this algorithm, arbitrary two vertexes in a given undirected graph can achieve a required vertex-connected degree. 利用该算法可最优地将给定无向图中任意2点达到所要求的点连通度。
- In undirected graph,w e can conveniently realize all of the operation, such as statistics the degree of node, add a edge, and delete a edge. 详细说明: 本文提出用无向图来描述电力系统网络结构, 邻接多重表是无向图的一种比较好的存储结构, 利用邻接多重表能比较方便的实现对无向图中节点的计算和边的操作,如统计节点的度, 增加一条边, 删除原有的边。
- A class of undirected graph G=
abstracted from practical problems whose vertices and edges have varied weight,a clique of graph G is maximum complete subgraph in G. 一类由实际问题抽象出来的点边具有变权值的无向图G=;图G的团是G中的极大完全子图。 - Definition.An undirected graph is called chordal if every cycle of length greater than three posseses a chord, that is, an edge joining two nonconsecutivevertices of the cycle. 定义:无向图中,如果任意边数大于3的环,至少存在一条边连接环中不相邻的某两个点,则称此图为弦图.
- From the analysis of a practical example, the article derives that the poly-solution structure of the maths model of the general linear goal programming is an undirected graph. 从一实例分析出发,推导出一般线性目标规划数学模型的多重解结构为一无向图。
- Three road merging algorithm, rapid sequencing of non - recursive algorithm, undirected graph of the non - recursive depth-first traversal, and we hope that it needs! 有许多是考研要用的!
- Firstly, the undirected graph model in product structure domain, the directed graph model in product function domain, and the vector table model in customer requirement domain were constructed. 分别构建了产品结构域无向图模型、功能域有向图模型和需求域向量表模型。
- The characteristic of MVP is the conversion from netlist to weighted undirected graph and its objective is to improve the efficiency of VLSI partitioner by avoiding partitioning netlist directly. MVP系统特点体现在VLSI线网到无向赋权图的转换,避免了剖分算法直接在VLSI线网上进行剖分,提高了VLSI剖分的效率。
- Connected unweighted undirected graphs 无向非加权图
- Finding bridges in undirected graph 求无向连通图中的桥
- Research of Offset Press Inking System Based on Undirected Graph 基于无向图的胶印机输墨系统研究
- An electrically produced graph or tracing. 电示图以电制作的图表或映描图