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

作     者：HAO Jian-ziu, LI Xiang-lu(1.Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China 2.Department of Administration, Zhongyuan Institute of Technology, Zhengzhou 450007, China) 

作者机构：Department of Mathematics Zhejiang Normal University Jinhua 321004 China Department of Administration Zhongyuan Institute of Technology Zhengzhou 450007 China 

出 版 物：《Chinese Quarterly Journal of Mathematics》 (数学季刊(英文))

年 卷 期：2004年第19卷第4期

页      面：362-367页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：SupportedbytheNaturalScienceFoundationofZhejiangProvince(102055) 

主　　题：graph labeling two-dimensional bandwidth L∞-norm 

摘      要：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.