... 顶点的 apical/climactic; meridian; vertexal; vertical; zenithal 顶点割 vertex cut 顶点集 vertex set ...
基于10个网页-相关网页
Vertex-Cut 切点法
minimum vertex cut 最小顶点切割
vertex cut set 顶点割集 ; 顶点割
edge-vertex cut atom 边点割原子
edge-vertex-cut atom 边点割原子
edge vertex cut fragment 边一点割断片
edge-vertex-cut fragment 边点割断片
basic saturated vertex cut 基本饱和点割
Moreover, the distribution of removable edges in the edge-vertex cut atom and its separating pair for 4-connected graphs was obtained.
同时给出4连通图4圈上和边点割原子及分离对上的可去边的分布。
This happens if the graph is disconnected or has a cut vertex.
如果一个图是不连通的或有割点，就发生这种情况。
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.
该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。
应用推荐