L∞模下的二维带宽问题

The two-dimensional bandwidth problem is to determine an embedding of graph G in a grid graph in the plane such that the longest edges are as short as possible. In this paper we study the problem under the distance of L∞-norm.     

图的割宽极值问题

The problem studied in this paper is to determine e(p, C), the minimum size of a connected graph G with given vertex number p and cut-width C.     

关于带宽极值问题的两个结果

本文研究的问题是确定ｅ＊（ｐ,Ｂ）的值,也就是确定顶点数为ｐ、带宽为Ｂ的连通图Ｇ的最小边数,本文给出当Ｂ＝ｐ＋３／２和Ｂ＝ｐ／２＋２时的精确结果。     

图的割宽最大值问题

§ 1　IntroductionThe cutwidth minimization problem for graphs arises from the circuitlayout of VLSIdesigns[1 ] .Chung pointed outthatthe cutwidth often corresponds to the area of the layoutin array layout in VLSI design[2 ] .In the layout models,the cutwidth problem deals withthe number of edges passing over a vertex when all vertices are arranged in a path.For agraph G with vertex set V(G) and edge set E(G) ,a labeling of G is a one-to-one mapping ffrom V(G) to the integers.The cutwid…     

关于L∞—模距离的二维带宽问题

二维宽带问题是将图G嵌入平面格子图,使其最长的连边尽可能短,迄今为止,在平面格子图中考虑的距离为矩线距离,即L1－模距离,在本文中,我们研究在L∞－模距离意义下的二维带宽问题。     

图的循环带宽和

Abstract. Let G be a simple graph. The cyclic bandwidth sum problem is to determine a labeling of graph G in a cycle such that the total length of edges is as small as possible. In this paper, some upper and lower bounds on cyclic bandwidth sum of graphs are studied.