Two models of two-dimensional bandwidth problems

Authors:
Lan Lin;Yixun Lin
Affiliations:
The Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai 200092, China and School of Electronics and Information Engineering, Tongji Universi ...;Department of Mathematics, Zhengzhou University, Zhengzhou 450052, China
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 0

The complexity of minimizing wire lengths in VLSI layouts

Information Processing Letters
VLSI layouts of complete graphs and star graphs

Information Processing Letters
A survey of graph layout problems

ACM Computing Surveys (CSUR)
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

The two-dimensional bandwidth problem is to embed a graph G into an nxn grid in the plane such that the maximum distance between adjacent vertices is as small as possible. Here, the ''distance'' has two different meanings: the L"1-norm distance and L"~-norm distance. So we have two models of two-dimensional bandwidth problem. This paper investigates the basic properties and relations of these two models. Some lower bounds, upper bounds, and exact results are presented.