L∞模下的二维带宽问题

数学季刊 ›› 2004, Vol. 19 ›› Issue (4): 362-367.

L_∞模下的二维带宽问题

1.Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China; 2.Department of Administration, Zhongyuan Institute of Technology, Zhengzhou 450007, China

收稿日期:2002-01-23 出版日期:2004-12-30 发布日期:2024-03-04
作者简介:HAO Jian-xiu(1966-),male,native of Xinyang,Henan,an associate professor of Zhejiang Normal University,Ph.D.,engages in combinatorics and optimization.
基金资助:
SupportedbytheNaturalScienceFoundationofZhejiangProvince(102055)；

Problems on Two-dimensional Bandwidth under Distance of L_∞-norm

1.Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China; 2.Department of Administration, Zhongyuan Institute of Technology, Zhengzhou 450007, China

Received:2002-01-23 Online:2004-12-30 Published:2024-03-04
About author:HAO Jian-xiu(1966-),male,native of Xinyang,Henan,an associate professor of Zhejiang Normal University,Ph.D.,engages in combinatorics and optimization.
Supported by:
SupportedbytheNaturalScienceFoundationofZhejiangProvince(102055)；

摘要/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 as short as possible. In this paper we study the problem under the distance of L_∞-norm.

关键词: graph labeling, two-dimensional bandwidth, L_∞-norm

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 as short as possible. In this paper we study the problem under the distance of L_∞-norm.

Key words: graph labeling, two-dimensional bandwidth, L_∞-norm

中图分类号:

O157.5

郝建修, 李湘露. L_∞模下的二维带宽问题[J]. 数学季刊, 2004, 19(4): 362-367.

HAO Jian-xiu, LI Xiang-lu. Problems on Two-dimensional Bandwidth under Distance of L_∞-norm[J]. Chinese Quarterly Journal of Mathematics, 2004, 19(4): 362-367.

[1]	张振坤, 叶稀琼. K 割宽临界树的构造[J]. 数学季刊, 2022, 37(4): 366-379.
[2]	张振坤, 余敏. 分裂图的区间图完全化问题[J]. 数学季刊, 2015, 30(2): 308-316.