1) cut point graph
割点图
2) Block-cutvertex graph
块一割点图
3) Edge and Vertex Connectivity
割边/割点
4) cut vertex
割点
1.
In this paper,a necessary condition that a cut vertex belongs to every γ s set of G is discussed,and a necessary and sufficient condition of existing indepedent set dominating set in G is given.
本文讨论了割点属于Ｇ的任一最小集控制集的必要条件，并且给出了Ｇ有独立集控制集的充要条件。
2.
Whereas the cut vertex or the small vertex cutset extraordinarily threaten the connectivity of overlay networks,for the removal of them will separate the network into many components.
P2P系统的可靠性主要取决于覆盖网节点间的连通性,而割点和小规模点割集对网络连通性的危害很大,它们的失效或离开能使覆盖网变得四分五裂。
3.
Let G is connected simple graph,v is a cut vertex of G,and G1 ,G2,… ,Gp(p≥ 2)are the v-components of G.
设G是一个简单连通图,v是G的一个割点,G_1,G_2…G_p(p≥2)是G的v—分支,q是一个正整数(1≤q≤p)。
5) graph cut
图割
1.
The graph cut technique is then applied to produce the segmentation result which is consistent to the user s in.
网格模型分片在计算机图形学应用中具有重要意义,本文提出了一种基于网格上的调和场和图割技术的网格模型分片算法。
2.
This paper presents a total variation(TV) image denoising algorithm based on graph cut.
本文提出一种基于图割的全变差(TV)图像去噪算法。
3.
The graph cut algorithm is one of high effective optimal methods in the stereo images matching.
图割算法是图像立体匹配算法中一种高效的最优化计算方法。
6) graph cuts
图割
1.
Contour extraction based on GVF Snake and graph cuts;
基于梯度矢量流Snake模型与图割的目标边界提取
2.
Fast concave object extraction algorithm based on graph cuts and GVF Snake;
基于图割与GVF Snake的凹型目标快速提取算法
3.
Moving object detection algorithm in stationary background based on graph cuts;
静止背景下基于图割的运动目标检测算法
补充资料：基本割集矩阵(见网络图论)
基本割集矩阵(见网络图论)
fundamental cut-set matrix
Jl匕en ge〕1〕日zhen基本割集矩阵(fundamental eut一setnla一trix)见网络图论。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条