New results on edge-bandwidth

Authors:
Tiziana Calamoneri;Annalisa Massini;Imrich Vrťo
Affiliations:
Computer Science Department, University of Rome "La Sapienza", Via Salaria 113, Rome 00198, Italy;Computer Science Department, University of Rome "La Sapienza", Via Salaria 113, Rome 00198, Italy;Institute of Mathematics, Slovak Academy of Sciences, Department of Informatics, Dúbravska 9, Bratislava 841 04 Slovak Republic
Venue:
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Year:
2003

Citing 12
Cited 3

A lower bound on the size of a complex generated by an antichain

Discrete Mathematics
An optimal pair sequences

Journal of Information Processing and Cybernetics
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
On the bandwidth of graph products

Journal of Information Processing and Cybernetics
On edge numberings of the n-cube graph

Discrete Applied Mathematics
On the bandwidth of triangulated triangles

Selected papers of the 14th British conference on Combinatorial conference
Bandwidth of the complete k-ary tree

Discrete Mathematics
On the bandwidth of convex triangulation meshes

Discrete Mathematics
Edge-Bandwidth of Graphs

SIAM Journal on Discrete Mathematics
Bounding the bandwidths for graphs

Theoretical Computer Science
The Complexity of the Approximation of the Bandwidth Problem

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The edge-bandwidth of theta graphs

Journal of Graph Theory

On the edge-bandwidth of graph products

Theoretical Computer Science
Edge-bandwidth of grids and tori

Theoretical Computer Science
Note: On explicit formulas for bandwidth and antibandwidth of hypercubes

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has to label the edges of a graph by distinct integers such that the maximum difference of labels of any two incident edges is minimized. We prove tight bounds on the edge-bandwidth of hypercube and butterfly graphs, and complete k-ary trees which extends and improves on previous known results.