| On Density Lower Bounds of Two Dimensional Bandwidth |
| Received:February 13, 1994 |
| Key Words:
graph labeliug, two-dimensional bandwidth.
|
| Fund Project:Supported by the National Natural Science Foundation of China. |
|
| Hits: 2435 |
| Download times: 1228 |
| Abstract: |
| 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. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.1996.03.007 |
| View Full Text View/Add Comment |
