图的最小顶点覆盖问题是图论中的一个NP完全问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP难题。
The problem of seeking monitor-nodes for measuring the network traffic is regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard.
该模型首先将问题解空间的DNA分子固定在固体载体上，然后通过进行相应的生化反应来求得图的最小顶点覆盖问题的所有解。
The DNA molecules of the solution space are fixed on the solid carrier, and then get the all solutions of minimal vertex covering problem by the biochemical actions.
在给定关系模式的属性集及其函数依赖最小覆盖集的基础上，提出一种基于模式图的规范化XML模式设计方法。
Given attribute set and minimum cover set of functional dependencies over one relational schema, a new method for designing normalized XML schemas based on schema graph is proposed.
对一个图而言，满足此条件的最小的自然数即为此图的覆盖数。
The cover pebbling number for lexicographic product graphs and some strong product graphs were determined.
给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法。
DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
本文主要研究QT -图的最小路覆盖问题。
本文主要研究QT -图的最小路覆盖问题。
应用推荐