minimal graph
- minimal graph的基本解释
-
-
[计] 最小图
- 更多网络例句与minimal graph相关的网络例句 [注：此内容来源于网络，仅供参考]
-
The minimal vertex-covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
-
Throughout, the presentation is streamlined, with elegant and straightforward proofs requiring minimal background in probability and graph theory.
自始至终，演示文稿精简，优雅的和直接的概率，并要求在最小的背景图论证明。
-
With the support of GIS , the minimal spanning tree theory of graph theory and 120 project theory can be applied to irrigation pipelines layout optimization .
建立以管道输水灌溉系统的年折算费用最小为目标函数的管径优化线性规划模型，并将内点法应用于线性优化模型的求解。
-
It is confirmable that the maximal flow of thenetwork is restricted by nothing else but Negative Envelope Graph, becausethe minimal cut of the network is hidden in it.
原来是它包含了网络的最小截，因而制约了网络的最大流量。
-
Using the concept of Minimal Spanning Tree in Graph Theory, the proposed method merges the over-segmented regions produced by watershed algorithm.
该方法主要利用图论中的最小生成树，对分水岭算法产生的过度分割区域进行合并。
- 加载更多网络例句 (10)
- 更多网络解释与minimal graph相关的网络解释 [注：此内容来源于网络，仅供参考]
-
minimal graph：极小图形
minimal generating set 不可约生成集 | minimal graph 极小图形 | minimal manifold 极小簇
-
minimal graph：最小图
最小函数 minimal function | 最小图 minimal graph | 最小潜伏,最短潜时 minimal latency
-
Minimal Complete Cells Graph：最小完备单元图
最小有向距离原理:Principle of minimal orientation-distance | 最小完备单元图:Minimal Complete Cells Graph | 最小顶点覆盖问题:Minimal vertex-covering problem