Abstract
We mainly show that the cutwidth of the mesh of d-ary trees MT(d, n) satisfies \(\frac{{d^{n - 2} \left( {d + 1} \right)^2 }}{8} - 1 \leqslant c\left( {MT\left( {d,n} \right)} \right) \leqslant \frac{{d^{n + 3} }}{{d - 1}}\); if d > 2, we also show that the bandwidth of this graph b(MT(d, n)) is in \(\theta \left( {d^{n + 1} \tfrac{{d^n - 1}}{{n\left( {d - 1} \right)}}} \right)\).
This work was supported by the “Opération RUMEUR” of the French PRC PRS.
Chapter PDF
Similar content being viewed by others
References
D. Barth, Réseaux d'interconnexion: structures et communications, Thesis, Université Bordeaux I, 1994.
D. Barth, F. Pellegrini, J. Roman, A. Raspaud, On bandwidth, cutwidth and quotient graphs, LaBRI intern report, RAIRO Theor. Comp. Science, vol. 29, n. 6, pp. 487–508, 1995.
C. Berge, Graphes et Hypergraphes, North Holland Publishing, 1971.
M.M. Eshaghian, V.K. Prasanna Kumar, Parallel Geometric Algorithms for Digitized Pictures on Mesh of Trees, Proc. of IEEE FOCS, pp 270–273, 1986.
F. Gavril, Some NP-complete problems on graphs, Proc. 11th Conf. on Inf. sciences and systems, W.H Freeman pub., San Francisco, 1979.
F.T. Leighton, Introduction to Parallel Algorithms and Architecture: arrays, trees, hypercubes, Morgan Kaufman Publisher, 1992.
C.H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing, vol. 16, pp. 263–270, 1976.
C.D. Thompson, Area-time complexity for VLSI, Proc. 11th STOCS, ACM, pp. 81–88, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barth, D. (1996). Bandwidth and cutwidth of the mesh of d-ary trees. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_31
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive