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 o...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.展开更多
基金National The Project Supported by Zhejiang Provincial Natural Science Foundation of China(102055)Naturen Science Foundation of China(No.10471131)The Foundation of Zhejiang Universities Youth Teachers
文摘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.
