On Density Lower Bounds of Two Dimensional Bandwidth
Received:February 13, 1994  
Key Word: graph labeliug, two-dimensional bandwidth.  
Fund ProjectL:Supported by the National Natural Science Foundation of China.
Author NameAffiliation
Lin Yixun Dept, of Math., Zhengzhou University, 450052 
Hits: 1520
Download times: 847
      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 short as possible. This paper gives several lower bounds and their applications to evaluate the bandwidth. All results are based on an approach of combinatorial geometry in the plane.
View Full Text  View/Add Comment  Download reader