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

被引：0
|
作者：
HAO Jian-ziu
2.Department of Administration
机构：
来源：
数学季刊 | 2004年 / 04期
关键词：
graph labeling; two-dimensional bandwidth; L∞-norm;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：362 / 367
页数：6
相关论文
共 50 条
  • [1] Two models of two-dimensional bandwidth problems
    Lin, Lan
    Lin, Yixun
    INFORMATION PROCESSING LETTERS, 2010, 110 (11) : 469 - 473
  • [2] Robust two-dimensional PCANet with F-norm distance metric
    Ge, Weimin
    Li, Jinjun
    Wang, Xiaofeng
    Zielinska, Teresa
    KNOWLEDGE-BASED SYSTEMS, 2024, 295
  • [3] Minimum L(p)-norm two-dimensional phase unwrapping
    Ghiglia, DC
    Romero, LA
    JOURNAL OF THE OPTICAL SOCIETY OF AMERICA A-OPTICS IMAGE SCIENCE AND VISION, 1996, 13 (10) : 1999 - 2013
  • [4] Two-dimensional bandwidth of graphs
    Hao, JX
    ARS COMBINATORIA, 2005, 74 : 77 - 88
  • [5] Two-Dimensional l(1)-Norm Minimization in SAR Image Reconstriction
    Lazarov, A.
    Minchev, D.
    CYBERNETICS AND INFORMATION TECHNOLOGIES, 2015, 15 (07) : 77 - 87
  • [6] L1-norm based Two-Dimensional Linear Discriminant Analysis
    Chen, Si-Bao
    Chen, Dao-Ran
    Luo, Bin
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2015, 37 (06): : 1372 - 1377
  • [7] Robust L1-norm two-dimensional linear discriminant analysis
    Li, Chun-Na
    Shao, Yuan-Hai
    Deng, Nai-Yang
    NEURAL NETWORKS, 2015, 65 : 92 - 104
  • [8] Experiments on the distance of two-dimensional samples
    Noszaly, Csaba
    ANNALES MATHEMATICAE ET INFORMATICAE, 2012, 39 : 193 - 206
  • [9] Two-dimensional potential problems
    Morris, RM
    PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1937, 33 : 474 - 484
  • [10] Two-dimensional partitioning problems
    Middendorf, M
    THEORETICAL COMPUTER SCIENCE, 1996, 164 (1-2) : 73 - 106
12345