排序方式: 共有6条查询结果,搜索用时 15 毫秒
1
1.
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. 相似文献
2.
3.
本文研究的问题是确定e*(p,B)的值,也就是确定顶点数为p、带宽为B的连通图G的最小边数,本文给出当B=p+3/2和B=p/2+2时的精确结果。 相似文献
4.
郝建修 《高校应用数学学报(英文版)》2003,18(2):235-242
§ 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… 相似文献
5.
图的循环带宽和 总被引:1,自引:0,他引:1
郝建修 《高校应用数学学报(英文版)》2001,16(2):115-121
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. 相似文献
6.
二维宽带问题是将图G嵌入平面格子图,使其最长的连边尽可能短,迄今为止,在平面格子图中考虑的距离为矩线距离,即L1-模距离,在本文中,我们研究在L∞-模距离意义下的二维带宽问题。 相似文献
1