As the minimum feedback vertex set problem is NP-complete, it is hard to be solved exactly.
最小反馈节点集问题是一个NP完全问题，很难准确求解。
The algorithm uses a group of connective nodes without loop as a generalized data gather vertex set.
算法选取网络中一组无环连通点集抽象为广义数据汇聚点集。
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is acyclic after removing the vertex subset from the graph.
若从一个图中去掉某些顶点后得到的导出子图是无圈图，则所去的那些顶点组成的集合就是原图的反馈点集。
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removing the vertex subset from the graph.
如果从一个图中去掉某些顶点后得到的导出子图是无圈图，则所去的那些顶点组成的集合就是原图的反馈点集。
The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.
该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。
Let G be a graph and let V(G) be the vertex set of G. Define the neighborhood complex N(G) as the simplicial complex whose simplices are those subsets of V(G) which have a common neighbor.
一个图G的邻域复形是以G的顶点为顶点，以G的具有公共邻接顶点的顶点子集为单形的抽象复形。
Software vertex processing provides a guaranteed set of vertex processing capabilities, including an unbounded number of lights and full support for programmable vertex shaders.
软件顶点处理提供可保证的顶点处理能力集，包括无限制的光源数量和对可编程的顶点着色器的完全支持。
In addition, the following table lists the values that are set for members of the D3DCAPS9 structure for a device in software vertex processing mode.
此外，下表列出设备在软件顶点处理模式中需设置的D3DCAPS9结构的成员的值。
This structure and Flexible Vertex Format (FVF) specify that we are talking about a vertex that has a position, a color, and a set of texture coordinates.
这个结构和灵活的顶点格式（FVF）定义了我们所谈论的包含位置，颜色和一组纹理坐标的顶点。
Firstly the constraints of weak vertex cover set are analyzed and the integer programming formulation for it is given.
首先分析了弱顶点覆盖集的约束关系，并给出了问题的整数规划形式。
Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
Only one vertex processing flag may be set for a device at any one time.
一次只能为设备设置一个顶点处理标识。
The set of commands for vertex shaders is quite small - it contains as little as 17 instructions that work with vector and scalar quantities.
顶点着色器的命令集很小：只包含了17条指令，用于处理矢量和标量。
This structure and Flexible vertex Format specify that we are talking about a vertex that has a position, a color, and a set of texture coordinates.
这个结构和灵活的顶点格式定义了我们所谈论的包含位置，颜色和一组纹理坐标的顶点。
Using the thought of mathematical set, this paper is intended to carry out a study into the algorithms for vertex coloration. Therefore, a simple algorithm can be found out.
利用集合的思想对顶点着色算法进行研究，得到一种简洁的顶点着色算法。
In particular, some upper bounds of the vertex arboricity of the integer distance graph G(Z, D) are obtained when D is a set of positive integers and Z the set of all integers.
特别地，当D是某正整数集合，Z是整数集时，得出了整数距离图G（Z ，D）的点荫度的几个上界。
The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.
MSS问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
This isn't quite right because we set the vertex colors to white.
这还不是很正确的，因为我们设置顶点的颜色是白色的。
This isn't quite right because we set the vertex colors to white.
这还不是很正确的，因为我们设置顶点的颜色是白色的。
应用推荐