Chinese Quarterly Journal of Mathematics ›› 2004, Vol. 19 ›› Issue (4): 362-367.

Previous Articles     Next Articles

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

  

  1. 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.

Key words: graph labeling, two-dimensional bandwidth, L-norm

CLC Number: