loading...
Combinatorial Properties of Mesh of Trees
Dallas/Richardson, Texas, USA December 07-December 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.9002772000 International Symposium on Paral ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The mesh of trees, which owns two favorable properties: small diameter and large bisection, is known as the fastest network when considered in terms of speed. In this paper, we show that the wide diameter, fault diameter, and Rabin number, which are three generalizations of diameter, of a two dimensional 2n x 2n mesh of trees are equal to 5n+I.
Citation:
W.-M. Chen, G.-H. Chen, F. Hsu, "Combinatorial Properties of Mesh of Trees," ispan, pp.134, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000
Usage of this product signifies your acceptance of the Terms of Use.