Combinatorial Properties of Mesh of Trees

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by W.-M. Chen Articles by G.-H. Chen Articles by F. Hsu

2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00)

Dallas/Richardson, Texas, USA

December 07-December 07

ISBN: 0-7695-0936-3

	ASCII Text	x
	W.-M. Chen, G.-H. Chen, F. Hsu, "Combinatorial Properties of Mesh of Trees," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 134, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000.

	BibTex	x
	@article{ 10.1109/ISPAN.2000.900277, author = {W.-M. Chen and G.-H. Chen and F. Hsu}, title = {Combinatorial Properties of Mesh of Trees}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2000}, issn = {1087-4089}, pages = {134}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.900277}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Combinatorial Properties of Mesh of Trees SN - 1087-4089 SP EP A1 - W.-M. Chen, A1 - G.-H. Chen, A1 - F. Hsu, PY - 2000 KW - null VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

W.-M. Chen

G.-H. Chen

F. Hsu

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.900277

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 2ⁿ x 2ⁿ 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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.