vertex cut的意思
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───偏序集最小頂點割算法與最小費用趕工問題