您要查找的是不是：
- connected vertex set 连通顶点集合
- In this paper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it. 本文主要考虑外平面图中的反馈点集并给出了一个求外平面图最小顶点赋权反馈点集的线性时间算法。
- The algorithm uses a group of connective nodes without loop as a generalized data gather vertex set. 算法选取网络中一组无环连通点集抽象为广义数据汇聚点集。
- S is also based Vertex Set T, T / S from the tree T Lieutenant General S vertex deletion the forest. 又设S 是T 的顶点集,T/S 是从树T 中 将S中顶点删去后得到的森林。
- In this paper, we study the minimum-weight feedback vertex set problem in seriesparallel graphs and present a linear-time exact algorithm to solve it. 文章摘要: A feedback vertex set is a subset of vertices in a graph; whose deletion from the graph makes the resulting graph acyclic.
- In this paper, we study the undirected minimum-cardinality feedback vertex set problem in outer-planar graphs and present a polynomial time algorithm to solve it. 本文讨论外平面图的反馈点集并给出了一个求外平面图最小反馈点集的多项式时间算法。
- Compare to existing results for general graph, new lower bound on the size of the minimum feedback vertex set of (n, k)-star graph is given based on its special structure. 本文主要讨论了关于组合星图反馈结点集的下界问题，在基于组合星图的性质和已有相关结果的基础上，给出了组合星图反馈结点集的新的下界。
- 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. 如果从一个图中去掉某些顶点后得到的导出子图是无圈图,则所去的那些顶点组成的集合就是原图的反馈点集。
- The concepts of front vertex set and arcs with cost-reducing potential are introduced, which decrease the times of iterations and the computation quantity of each time. 文中提出了前沿节点和含潜弧的概念,并利用这些概念减少了最短路算法的迭代次数和每次迭代的计算量。
- The eccentric digraph ED(G) of G is the digraph that has the same vertex set as Gand the arc set defined by : there is an arc from u to v if and only if v is an eccentricvertex of u . 定义G的离心图(eccentric digraph)如下:顶点集为V (G) ,弧集满足:有一条弧从v到u当且仅当顶点u是v的一个离心点,记为ED(G)。
- Subdivide Smooth - Same as Subdivide, but new vertices are displaced towards the barycenter (centre of mass) of the connected vertices. 不规则多次细分-与上一样，但它是在用户定制的范围内随机置换细分。
- Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency. 如果在两个图之间存在一个保持邻接性的1-1对应，则这两个图是同构的。
- Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency . 如果在两个图之间存在一个保持邻接性的1-1对应，则这两个图是同构的。
- Minimum Feedback Vertex Set in Folded Hypercubes 折叠立方体网络的最小反馈点集
- A set of staffs connected in this way. 用这种方式连接的一组五线谱
- generalized data gather vertex set 广义数据汇聚点集
- It is now our aim to set up a factory. 我们现在的目的是创办一座工厂。
- Jeff connected the caravan to the car. 杰夫把大蓬车挂在汽车上。
- He is connected with the Changs by marriage. 他与张家是姻亲。
- She had the sapphire set in a gold ring. 她把那枚蓝宝石镶在金戒指上了。
