covering graph的中文,翻译,解释,例句
covering graph
- covering graph的基本解释
-
-
覆盖图
- 更多网络例句与covering graph相关的网络例句 [注：此内容来源于网络，仅供参考]
-
The minimal vertex-covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
-
In this paper the capacity of tree-flower in Edmonds theorem of graph theory is extended to minimum covering points and a computing formula of minimum covering points for non-dual graph is introduced.
文中把图论里Edmonds定理的树花容量扩展为最小复盖点，并得到了计算非偶图最小复盖点数的公式。
-
In this paper, the maximum graph packing and the minimum graph covering of two graphsD_1, D_2 with six vertices and eight edges and the 8-cycle C_8 are researched.
在统一的构作方法下，对于两个六点八边图所有可能的v和λ给出了相应的最大图填充和最小图覆盖的构造。
- 更多网络解释与covering graph相关的网络解释 [注：此内容来源于网络，仅供参考]
-
Minimal Complete Cells Graph：最小完备单元图
最小有向距离原理:Principle of minimal orientation-distance | 最小完备单元图:Minimal Complete Cells Graph | 最小顶点覆盖问题:Minimal vertex-covering problem