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. (C) 2003 Elsevier B.V. All rights reserved.
New results on edge-bandwidth / Calamoneri, Tiziana; Massini, Annalisa; Imrich, Vrto. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - STAMPA. - 307:3(2003), pp. 503-513. [10.1016/s0304-3975(03)00234-2]
New results on edge-bandwidth
CALAMONERI, Tiziana;MASSINI, Annalisa;
2003
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. (C) 2003 Elsevier B.V. All rights reserved.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
