| 二维带宽的浓度下界（英） |
| |
| 引用本文： | 林诒勋.二维带宽的浓度下界（英）[J].数学研究及应用,1996,16(3):343-349. |
| |
| 作者姓名： | 林诒勋 |
| |
| 作者单位： | 郑州大学数学系，450052 |
| |
| 摘 要： | 二维带宽问题是确定图G在平面格子图中的一个嵌入，使最长的边尽可能短.本文研究若干个下界以及它们应用于带宽的估值.所有结果均建立在一种平面组合几何的方法之上.其中的浓度下界改进了文献3]的结果.
|
| 收稿时间： | 1994/2/13 0:00:00 |
On Density Lower Bounds of Two Dimensional Bandwidth |
| |
| Lin Yixun.On Density Lower Bounds of Two Dimensional Bandwidth[J].Journal of Mathematical Research with Applications,1996,16(3):343-349. |
| |
| Authors: | Lin Yixun |
| |
| Institution: | Dept, of Math., Zhengzhou University, 450052 |
| |
| 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. |
| |
| Keywords: | graph labeliug two-dimensional bandwidth |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
