Bandwidth and cutwidth of the mesh of d-ary trees

  • Dominique Barth
Workshop 02 Routing and Communication in Interconnection Networks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1123)


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)\).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Barth, Réseaux d'interconnexion: structures et communications, Thesis, Université Bordeaux I, 1994.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    C. Berge, Graphes et Hypergraphes, North Holland Publishing, 1971.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    F. Gavril, Some NP-complete problems on graphs, Proc. 11th Conf. on Inf. sciences and systems, W.H Freeman pub., San Francisco, 1979.Google Scholar
  6. 6.
    F.T. Leighton, Introduction to Parallel Algorithms and Architecture: arrays, trees, hypercubes, Morgan Kaufman Publisher, 1992.Google Scholar
  7. 7.
    C.H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing, vol. 16, pp. 263–270, 1976.Google Scholar
  8. 8.
    C.D. Thompson, Area-time complexity for VLSI, Proc. 11th STOCS, ACM, pp. 81–88, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Dominique Barth
    • 1
  1. 1.LRI U.R.A. CNRS 410Université de Paris Sud, Centre d'OrsayOrsayFrance

Personalised recommendations