Two models of two-dimensional bandwidth problems

The two-dimensional bandwidth problem is to embed a graph G into an n × n 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-d...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 2010-05, Vol.110 (11), p.469-473
Hauptverfasser:	Lin, Lan, Lin, Yixun
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Bandwidth Bandwidths Combinatorics Combinatorics. Ordered structures Computer science control theory systems Exact sciences and technology Graph algorithms Graph theory Graphs Information retrieval. Graph Lower bound Lower bounds Mathematics Miscellaneous Optimal embedding Planes Sciences and techniques of general use Studies Theoretical computing Two dimensional Two-dimensional bandwidth Upper bound Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The two-dimensional bandwidth problem is to embed a graph G into an n × n 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.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/j.ipl.2010.04.013