contractible graph
- contractible graph的基本解释
-
-
[计] 可收缩图
- 更多网络例句与contractible graph相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Together with some basic knowledge of Linear Algebra, we prove that there exists a polynomial time algorithm for finding the shortest contractible cycle in an locally LEW-embedded graph. 3. By some results of Minor Theorem, we prove the crossing numbers of some circular graphs C(10,4), C(9,3), C(8,3) on the projective plane.
利用C.Thomassen在大边宽嵌入方面的工作，得到了局部大边宽嵌入图的一些性质，再利用线性代数的知识，证明了在局部大边宽条件下存在多项式时间算法可以找到一个图的最短可收缩圈。
-
This implies the existence of a polynomially bounded algorithm to find a shortest contractible cycle, a shortest separating cycle, and shortest cycle in an embedded graph in the projective plane and answers the open problems raised by Mohar and Thomassen in the case of projective plane embedded graph.
另一方面，通过定义嵌入图的几何对偶图及其相应的嵌入系统，得到几何对偶图中的可分离圈就对应于原图中的割；反之，若几何对偶图中的割在原图中对应于一个圈，那么该圈一定可分离。
-
We also show that for a fixed surface S, if the face-width of an embedded graph 0 in S is large enough, then there exists a polynomially bounded algorithm to find a shortest contractible cycle in G.
从而在射影平面上解决了Mohar与Thomassen关于是否存在多项式算法寻找短圈的问题。对于一般曲面上嵌入图，只要它的面宽度充分大，那么同样有多项式算法发现最短可收缩圈。
- 更多网络解释与contractible graph相关的网络解释 [注：此内容来源于网络，仅供参考]
-
contractible graph：可缩图
contractibility 收缩性 | contractible graph 可缩图 | contractible topological space 可缩拓扑空间
-
contractible graph：可缩的图
contractibility | 收缩, 收缩性 | contractible graph | 可缩的图 | contractible space | 可缩(成一点)的空间
-
contractible graph：可简化图
简化记法 contracted notation | 可简化图 contractible graph | 收缩 contraction