Geodesic
Binary trees, fringe thickness and minimum path length
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 3, pp. 171-191 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

@article{ITA_1995__29_3_171_0,
     author = {Cameron, Helen and Wood, Derick},
     title = {Binary trees, fringe thickness and minimum path length},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {171--191},
     year = {1995},
     publisher = {EDP-Sciences},
     volume = {29},
     number = {3},
     mrnumber = {1347592},
     zbl = {0833.68092},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1995__29_3_171_0/}
}
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
SP  - 171
EP  - 191
VL  - 29
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1995__29_3_171_0/
LA  - en
ID  - ITA_1995__29_3_171_0
ER  - 
%0 Journal Article
%A Cameron, Helen
%A Wood, Derick
%T Binary trees, fringe thickness and minimum path length
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1995
%P 171-191
%V 29
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1995__29_3_171_0/
%G en
%F ITA_1995__29_3_171_0
Cameron, Helen; Wood, Derick. Binary trees, fringe thickness and minimum path length. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 3, pp. 171-191. http://geodesic.mathdoc.fr/item/ITA_1995__29_3_171_0/