Constructing Binary Huffman Tree

Hiroyuki Okazaki; Yuichi Futa; Yasunari Shidama

Displaying similar documents to “Constructing Binary Huffman Tree”

A note on naturally embedded ternary trees.

Kuba, Markus (2011)

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:

A note on the distribution of the three types of nodes in uniform binary trees.

Prodinger, Helmut (1996)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

Dissimilarity vectors of trees are contained in the tropical Grassmannian.

Iriarte Giraldo, Benjamin (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Operads and algebraic combinatorics of trees.

Chapoton, Frédéric (2007)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

The product of trees in the Loday-Ronco algebra through Catalan alternative tableaux.

Aval, Jean-Christophe, Viennot, Xavier (2010)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

Free Term Algebras

Grzegorz Bancerek (2012)

Formalized Mathematics

Similarity:

We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as algerbras of term free in itself (any function from free generators into the algebra generates endomorphism of the algebra). Introduced algebras are free in classes of algebras satisfying some sets of equalities. Their universes are subsets of all terms and the denotations of operation symbols are partially identical with the operations of construction of terms. These algebras are compiler...

Perfect matchings and $k$ -decomposability of increasing trees.

Kuba, Markus, Wagner, Stephan (2006)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

Planting Kurepa trees and killing Jech-Кunen trees in a model by using one inaccessible cardinal

Saharon Shelah, R. Jin (1992)

Fundamenta Mathematicae

Similarity:

By an $ω_{1}$ - tree we mean a tree of power $ω_{1}$ and height $ω_{1}$ . Under CH and $2^{ω_{1}} > ω_{2}$ we call an $ω_{1}$ -tree a Jech-Kunen tree if it has κ-many branches for some κ strictly between $ω_{1}$ and $2^{ω_{1}}$ . In this paper we prove that, assuming the existence of one inaccessible cardinal, (1) it is consistent with CH plus $2^{ω_{1}} > ω_{2}$ that there exist Kurepa trees and there are no Jech-Kunen trees, which answers a question of [Ji2], (2) it is consistent with CH plus $2^{ω_{1}} = ω_{4}$ that there only exist Kurepa trees with $ω_{3}$ -many branches, which answers...

Complexes of Directed Trees of Complete Multipartite Graphs

Duško Jojić (2012)

Publications de l'Institut Mathématique

Similarity:

The height of $q$ -binary search trees.

Drmota, Michael, Prodinger, Helmut (2002)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Tree compression pushdown automaton

Jan Janoušek, Bořivoj Melichar, Martin Poliak (2012)

Kybernetika

Similarity:

A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is presented. The tree compression automaton represents a complete compressed index of a set of trees for subtrees and accepts all subtrees of given trees. The algorithm for constructing our pushdown automaton is incremental. For a single tree with $n$ nodes, the automaton has at most $n + 1$ states, its transition function cardinality is at most $4 n$ and there are $2 n + 1$ pushdown store symbols. If hashing is used...