A note on naturally embedded ternary trees.
Kuba, Markus (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A note on the distribution of the three types of nodes in uniform binary trees.”
A note on naturally embedded ternary trees.
Splaying a search tree in preorder takes linear time.
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Constructing Binary Huffman Tree
Hiroyuki Okazaki, Yuichi Futa, Yasunari Shidama (2013)
Formalized Mathematics
Similarity:
Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.
On some polynomial solvable cases of the generalized minimum spanning tree problem.
Pop, Petrică Claudiu (2005)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Binary trees, fringe thickness and minimum path length
Helen Cameron, Derick Wood (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Perfect matchings and -decomposability of increasing trees.
Kuba, Markus, Wagner, Stephan (2006)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On the distribution of depths in increasing trees.
Kuba, Markus, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The combinatorics of evolutionary trees---a survey.
Székely, Laszlo A., Erdős, Péter L., Steel, M.A. (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
NP-completeness of minimal width unordered tree layout.
Marriott, Kim, Stuckey, Peter J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
On the rules for the elimination of the non-canonical Morgan trees
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity: