Abstract
We introduce the notion of bandsize (in analogy to bandwidth) as the minimumnumber of edge-differences over all vertex-numberings. We make several observations which allow us to estimate the bandsize of complete binary trees. It follows from our results that the bandsize of the complete binary tree of heightn, n > 10, is betweenc 1 n andc 2 n where 0 <c 1 <c 2 < 1. This is in sharp contrast with the bandwidth of these trees which is roughly\(\frac{{2^n }}{n}\).
Similar content being viewed by others
References
Akyuz, F.A., Utku, S.: An automatic node-relabelling scheme for bandwidth minimization of stiffness matrices. J. Am. Inst. Aeronautics and Astronautics6, 728–730 (1968)
Chen, K.W., Irani, K.B.: Mapping problem and graph numbering. In: Proc. Workshop on Interconn. Networks for Parallel and Distr. Processing (H.J. Siegel ed.) pp. 41–46. IEEE 1980
Chinn, P.Z., Chvátalová, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices. J. Graph Theory6, 223–254 (1982)
Cuthill, E.: Several strategies for reducing the bandwidth of matrices in sparse matrices and their applications (D. Rose and R. Willoughby eds.) pp. 157–166. New York: Plenum Press N.Y. 1972
Dewdney, A.K.: The bandwidth problem for graphs: some recent results. In: 9th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 273–288. Winnipeg: Utilitas Math, 1976
Garey, M.R., Graham, R.L., Johnson, D.S., Knuth, D.E.: Complexity results for bandwidth minimization. SIAM J. Appl. Math.34, 477–495 (1978)
Harper, L.H.: Optimal numberings and isoperimetric problems on graphs. J. Comb. Theory1 385–393 (1966)
Kahn, J., Kleitman, D.J.: On cross-bandwidth. Discrete Math.33, 385–393 (1981)
Saxe, J.B.: Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebraic and Discrete Methods1, 363–369 (1980).
Tewarson, R.P.: Row column permutation of sparse matrices. Computer J.10, 300–305 (1967)
Author information
Authors and Affiliations
Additional information
The authors acknowledge the support of N.S.E.R.C. grants U-0165 and A-5075 respectively.
Rights and permissions
About this article
Cite this article
Heinrich, K., Hell, P. On the problem of bandsize. Graphs and Combinatorics 3, 279–284 (1987). https://doi.org/10.1007/BF01788550
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788550