Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0304-3975(03)00234-2 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
tight bound,Butterfly,edge-bandwidth problem,maximum difference,Edge-bandwidth,classical bandwidth problem,previous known result,Hypercube,complete k-ary tree,new result,butterfly graph,distinct integer,incident edge,Bandwidth | Journal | 307 |
Issue | ISSN | Citations |
3 | Theoretical Computer Science | 3 |
PageRank | References | Authors |
0.44 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tiziana Calamoneri | 1 | 511 | 46.80 |
| Annalisa Massini | 2 | 137 | 15.53 |
| Imrich Vrťo | 3 | 85 | 8.36 |