vertex cut信息详情
点割集
vertex───n.顶点；[昆]头顶；[天]天顶
vertex standard───顶点标准
cut cut───切，切
cut───v.割破；（用刀等）切下，割成；剪短；释放；剪裁；削减；删节；剪切；停止做；断绝（关系）；剪辑；切换画面；旷（课）；伤害；切牌；相交；劈出（通道）；录制（音响）；adj.缩减的；割下的；雕过的；n.切，割；伤口；开口；削减；理发；（服装等的）式样；（钱的）份额；删节；割下的肉；伤害的话（或行为）；（场景）切换；（比赛）半程；切球；乐曲；剪辑；河道
thinly cut cut───薄薄的
faceted cut───翻光面琢型
clean cut───净切削，无氧化皮切削，光洁木板；精确切割；轮廓鲜明的；好看的
florets cut───小花剪
cut price───降价；削价
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.───该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。
This happens if the graph is disconnected or has a cut vertex.───如果一个图是不连通的或有割点，就发生这种情况。
Moreover, the distribution of removable edges in the edge-vertex cut atom and its separating pair for 4-connected graphs was obtained.───同时给出4连通图4圈上和边点割原子及分离对上的可去边的分布。
The basic decomposition result is that if a vertex cut S of G is a clique, then G is decomposable by S.───基本的可分解定理是：如果图G的一个点割集S是一个团，则G经由S是可分解的。
An Algorithm for Minimum Vertex Cut Set of Partially Ordered Sets and the Problem of Minimum Cost of Crashed Tasks───偏序集最小顶点割算法与最小费用赶工问题