The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
In Chapter two, the minimal energy graph for this kind of graphs in some cases is obtained.
在第二章里，得到了这类图的极小能量图。
In chapter two, the minimal energy graph for fully angular hexagonal chains is helical hexagonal chain.
在第二章中，得到了全角六角链的极小能量图是螺旋链。
G is a minimal connected graph.
是一个极小连通图。
Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.
最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。
The second, the assignment of minimal live marking for choice-free repetitive Petri net is transformed into the assignment of minimal live marking for the strong connective T graph.
然后将无冲突可重复网的极小活标识的配置化为强连通-T图极小活标识的配置。
For the subclasses MAX and MARG of minimal unsatisfiable formulas, we show that the variable and literal renaming problems are equivalent to the graph isomorphism problem GI.
对于极小不可满足公式的子类MAX和MARG，我们证明了：其变元改名和文字改名的复杂性等价于图同构问题GI。
A well-formed dependency graph will show a minimal number of dependencies.
格式正确的依赖项关系图显示的依赖关系数量将很少。
A complete recursive algorithm for minimal reduction under graph view is designed.
本文提出图表示下的知识约简，给出图表示下求最小约简的完备递归算法。
A complete recursive algorithm for minimal reduction under graph view is designed.
本文提出图表示下的知识约简，给出图表示下求最小约简的完备递归算法。
应用推荐