Binary trees, fringe thickness and minimum path length

Helen Cameron; Derick Wood

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1995)

  • Volume: 29, Issue: 3, page 171-191
  • ISSN: 0988-3754

How to cite

top

Cameron, Helen, and Wood, Derick. "Binary trees, fringe thickness and minimum path length." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 29.3 (1995): 171-191. <http://eudml.org/doc/92503>.

@article{Cameron1995,
author = {Cameron, Helen, Wood, Derick},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {binary trees; fringe thickness; minimum path length},
language = {eng},
number = {3},
pages = {171-191},
publisher = {EDP-Sciences},
title = {Binary trees, fringe thickness and minimum path length},
url = {http://eudml.org/doc/92503},
volume = {29},
year = {1995},
}

TY - JOUR
AU - Cameron, Helen
AU - Wood, Derick
TI - Binary trees, fringe thickness and minimum path length
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1995
PB - EDP-Sciences
VL - 29
IS - 3
SP - 171
EP - 191
LA - eng
KW - binary trees; fringe thickness; minimum path length
UR - http://eudml.org/doc/92503
ER -

References

top
  1. [CAM91]. H. CAMERON, Extremal Cost Binary Trees, PhD thesis, University of Waterloo, 1991. 
  2. [CW94]. H. CAMERON and D. WOOD, Maximal path length of binary trees, Discrete Applied Mathematics, 1994, 55 (1), pp. 15-35. Zbl0821.68094MR1298512
  3. [DP94]. R. DE PRISCO, G. PARLATI and G. PERSIANO, On the path length of trees with known fringe, Unpublished manuscript, 1994. Zbl0875.68705
  4. [DP94]. A. DE SANTIS and G. PERSIANO, Tight upper and lower bounds on the path length of binary trees, SIAM Journal on Computing, 1994, 23 (1), pp. 12-23. Zbl0802.68034MR1258991
  5. [Knu73]. D. E. KNUTH, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973. MR445948
  6. [KW89]. R. KLEIN and D. WOOD, On the path length of binary trees, Journal of the ACM, 1989, 36 (2), pp. 280-289. Zbl0674.68012MR1072422
  7. [NW73]. J. NIEVERGELT and CHAK-KUEN WONG, Upper bounds for the total path length of binary trees, Journal of the ACM, January 1973, 20 (1), pp. 1-6. Zbl0263.68022MR495300

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.