Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0833.68092
Cameron, Helen; Wood, Derick
Binary trees, fringe thickness and minimum path length. (English)
[J] RAIRO, Inform. Théor. Appl. 29, No.3, 171-191 (1995). ISSN 0988-3754

Summary: We solve the following problem: Characterize the minimum-path-length binary trees with respect to size and fringe thickness, where the fringe thickness of a tree is the difference between the lengths of shortest and longest root-to-frontier paths. This result demonstrates that minimum path length is, in this setting, more amenable to analysis than maximum path length.

MSC 2000:: *68R10 Graph theory in connection with computer science

Keywords: binary trees; fringe thickness; minimum path length

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]