Cutwidth相关论文
The cutwidth problem for a graph G is to embed G into a path such that the maximum number of overlap edges is minimized.......
The cutwidth problem for a graph G is to embed G into a path Pn such that the maximum number of overlap edges (i. e. , t......
The problem studied in this paper is to determine E(p,C),the maximum size of aconnected graph G with the given vertex nu......
起源于VLSI设计及网络通讯,一个图的割宽是将它嵌入于一条路的最小"拥挤度".研究了割宽与其它图论参数的关系,包括与带宽、路宽、......
图的割宽问题在一般情形下，是NP难的，但对于树的情形有多项式算法．本文对于毛毛虫树给出了对其进行三角和四边形变换后，割宽保持不变的......
研究超图的标号性质,首先利用拉普拉斯张量的第二小和最大特征值给出4一致超图的带宽和与割宽的上下界;其次构造与超图对应的简单......
运用图的部分为工具，本文讨论图的拓扑带宽和割宽的关系。...
The cutwidth problem for a graph G is to embed G into a path such that the maximum number of overlap edges is minimized.......
The problem studied in this paper is to determine E(p,C),the maximum size of a connected graph G with the given vertex n......
The cutwidth problem for a graph G is to embed G into a path Pn such that the maximum number of overlap edges (i. e. , t......
