1) cutwidth
割宽
1.
Originating from VLSI design and network communication,the cutwidth problem is to embed all the apexes of graph G with n apexes onto the different integral points of a straight line,making the maximum number of overlap edges minimized.
起源于超大规模集成电路设计和网络通讯的图的割宽(cutwidth)问题,就是把一个含有n个顶点的图G的全部顶点分别安装在一条直线的不同的整数点上,使得跨越各顶点的边数的最大值(即稠密度)达到最小。
2.
Arising from the VLSI design and network communication, the cutwidth of a graph G is the minimum congestion for embedding G into a path.
起源于 VLSI设计及网络通讯 ,一个图的割宽是将它嵌入于一条路的最小“拥挤度”。
3.
The cutwidth problem is known that the problem for general graphs is NP hard while it is polynomially solvable for trees.
图的割宽问题在一般情形下,是NP难的,但对于树的情形有多项式算法。
2) width of seperating roller
分割槽宽
3) width incised
切割缝宽
4) widen swath
加宽割幅
5) Eliminated cutwidth
消去割宽
6) width of cut (wc)
切割宽度
补充资料：宽割
1.犹宽解。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条