割宽与图的有关参数(英文)

Cutwidth and Related Parameters of Graphs

起源于 VLSI设计及网络通讯 ,一个图的割宽是将它嵌入于一条路的最小“拥挤度”.研究了割宽与其它图论参数的关系 ,包括与带宽、路宽。

Arising from the VLSI design and network communication, the cutwidth of a graph G is the minimum 'congestion' for embedding G into a path. Some relations between cutwidth and other graph-theoretic parameters, such as bandwidth, pathwidth, treewidth and pagenumber, are studied.