The average diameter of binary tree structures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The average diameter of binary tree structures

Full text

Pdf (378 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1997 ACM symposium on Applied computing table of contents

San Jose, California, United States

Pages: 40 - 44

Year of Publication: 1997

ISBN:0-89791-850-9

Author

Zhizhang Shen

Dept. of Computer Science, Plymouth State College (USNH), Plymouth, NH

Sponsors

SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 44, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/331697.331707 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Bertsekas, D., Dynamic behavior of shortest path routing algorithms for communication networks, IEEE Transaction on Automatic Control 27(1)(Feb. 1982).
	2	Ronald L. Graham , Donald E. Knuth , Oren Patashnik, Concrete Math, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1988
	3	Hung Khei Huang , Tatsuya Suda, Collision avoidance tree networks, Computer Networks and ISDN Systems, v.26 n.6-8, p.895-911, March 1994 [doi>10.1016/0169-7552(94)90052-3]
	4	K~mth, D., The Art of Computer Prog'rammin.q Vol. I (Second Editiov.), Addison-Wesley P,lblishing Co., Rea(ling, MA, 1973.
	5	Leiserson, C.E., Fat-t. recs: ,miversal networks for hardware efficient s,lper(:mnp,lting, in P'roc. of the I985 lnteT'national Conference on Parallel P't'oce.~sing, 393-402, 1985.
	6	F. Thomson Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991
	7	Jie Li , Hisao Kameda, Optimal load balancing in tree networks with two-way traffic, Computer Networks and ISDN Systems, v.25 n.12, p.1335-1348, July 1993 [doi>10.1016/0169-7552(93)90023-W]
	8	Russ Miller , Quentin F. Stout, Parallel algorithms for regular architectures: meshes and pyramids, MIT Press, Cambridge, MA, 1996
	9	Zhizhang Shen, Static behavior analysis of a mesh system, Information Processing Letters, v.47 n.6, p.295-299, Oct. 18, 1993 [doi>10.1016/0020-0190(93)90075-K]
	10	Shen, Z., A matheIlmtical model for nmsh's dynamic behavior, Computers Mathem. atical Application 28(6)(1994) 25-32.
	11	Salvatore J Stolfo , Daniel P Miranker, The DADO production system machine, Journal of Parallel and Distributed Computing, v.3 n.2, p.269-296, June 1986 [doi>10.1016/0743-7315(86)90007-9]
	12	Arie Tamir, The least element property of center location on tree networks with applications to distance and precedence constrained problems, Mathematical Programming: Series A and B, v.62 n.3, p.475-496, Dec. 8, 1993 [doi>10.1007/BF01585179]
	13	Thinking Machine Corporation, The .CM-5 Technical Summary, Cambridge, MA, 1991.
	14	Alan Tucker, Applied combinatorics (3rd ed.), John Wiley & Sons, Inc., New York, NY, 1994
	15	Zheng Wang , Jon Crowcroft, Analysis of shortest-path routing algorithms in a dynamic network environment, ACM SIGCOMM Computer Communication Review, v.22 n.2, p.63-71, April 1992 [doi>10.1145/141800.141805]
	16	'fill, Z., Tree and Ring Access and Backbone Networks Design, Ph.D. Dissertation, Purdue University, West Lafayette, IN, 1992.