结点集 meaning in English

nodal set

A series of recent papers has aimed at giving good bounds of feedback vertex set for families of graphs broadly known as : butterflies , hypercubes , meshes , star graphs , and so on
摘要最近诸多文章旨在讨论关于反馈结点集的上下界问题，比如：蝴蝶网、超立方体、网格、星图等等。
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
本文主要讨论了关于组合星图反馈结点集的下界问题，在基于组合星图的性质和已有相关结果的基础上，给出了组合星图反馈结点集的新的下界。
It firstly utilizes the characteristic of layout geometric information to partition the global network into some sub networks . after these sub networks are compressed by cholesky factorization , the sub networks edge nodes are combined with other nodes . calculating the final linear equations group , the algorithm can be very effective
算法首先利用版图几何特征，按最小割原理将电源地网划分成子网，利用对称正定矩阵cholesky分解压缩子网内点；将子网等效成与网络其它部分连接的结点集的等效网络，最后通过计算压缩后的网络，获得线性方程组求解答案。