作者：郝建修; 李湘露二维带宽图形标记最优化稀疏矩阵
摘要：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.
注：因版权方要求，不能公开全文，如需全文，请咨询杂志社
