undirected graph的例句大全

A Simple Algorithm for Enumerating All the Minimal Cuts of An Undirected Graph

枚举一个无向图所有最小割集的一种简单算法

Markov network is an undirected graph, while Bayesian network is a directed acyclic graph.

Markov网是一个无向图, 而Bayesian网是一个有向无环图.

Design and a search set to calculate the connectivity of undirected graph branch algorithm.

设计用并查集来计算一个无向图的连通分支的算法.

A circ is an undirected graph having only vertices of even nonzero degree.

一广义圈是一无向图，其顶点次数都是非零偶数。

Broadcast networks can be expressed by a simple connected undirected graph.

将广播网络用简单连通的无向图表示.

Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices ( i.e., a clique) having the largest total weight.

给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集（团）具有最大权。

A method to build dimensioning model of 2 dimensional drawing based on undirected graph is presented.

提出了一种基于图结构描述的二维图形尺寸标注模型的建立及存储方法。

Object-oriented undirected graph model in P& ID design system

基于对象的P&ID设计软件无向图模型

Wireless sensor network could be described as an undirected graph.

无线传感器网络可以用无向图表示，节点及其一跳邻节点构成一个子图。

Let G be a finite, simple and undirected graph.

设G是有限简单无向图。

Let G be a simple undirected graph and C be the complement of C.

设G是一个简单无向图，酉麦示G的补图。

An Algorithm of Seeking Maximum Clique in Any Undirected Graph and Its Computer Programming

寻求任意无向图的最大团集的一个算法及其程序

Then it studies a topology failure location method based on undirected graph to recover IP network from failure.

并在此基础上，研究了一种基于无向图的拓扑故障定位方法，为IP网络的故障排除提供了有力依据。

An Algorithm of Seeking All Subgraphs of a Connected Simple Undirected Graph and Its Application

求解连通无向简图的所有连通子图的算法及其应用

CRFs is a good undirected graph conditional probability model, mainly used to label and segment sequent data. CRFs model can get the global optimal label result using context features.

CRFs模型是目前比较优秀的无向图条件概率模型，主要用于标记和分割序列数据，可以利用上下文特征获得全局最优的标注结果。

An Approximation Algorithm for Finding the Longest Path in Undirected Connected Graph under Constrains

无向连通图中求约束条件下近似最长路算法

finally, the definition of high connectivity graph was extended to be used in undirected weighted graph, and was taken as termination criteria for graph partitioning.

对高连通图的定义进行引申后，用于无向有权图中，并将高连通图的判据作为图分割的终止判据。

based on graph theory and lyapunov stability theory, the adaptive control method is employed to achieve leader-following consensus in an undirected network of agents with nonlinear third-order dynamics against the perturbations.

基于图论和Lyapunov稳定性理论，使用自适应控制方法，使无向网络中非线性三阶多智能体系统达到自适应领导者跟随一致性，并有效地解决了扰动问题。

discussions about the two algorithms for finding the minimal spanning tree of an undirected weighted graph

求无向赋权图最小生成树的两种算法的探讨

Finding the minimum spanning trees of undirected complete graph based on global optimization

基于Global Optimization寻找无向完全图的最小生成树