We consider the minimal directed ac

We consider the minimal directed acyclyc graph (DAG) lossless compres-
sion strategy introduced in Kieer et. al [3], with the aim of testing its asymptotic
eectiveness on binary trees of size n. We have four models for studying the com-
pression strategy: two ways of measuring size (either the number of leaves or the
depth of the tree), and two types of probability distributions (all planar trees are
equally likely, or all nonplanar trees are equally likely). We calculate the average
compression achieved by Kieer et. al's strategy for some specic example classes
of binary trees, and then more generally, averaging over all (either nonplanar, or
planar) binary trees of a xed size n. We use the results to draw conclusions about
the kinds of trees for which the strategy is eective. An ultimate goal is to deter-
mine the extent to which the size of the DAG is correlated with the information
embodied in the associated tree.

ผลลัพธ์ (แอฟริกา) 1:

Die Minimal Directed Acyclyc ons kyk grafiek (DAG) lossless Compres-
Sion strategie bekendgestel in Kie er et?. AL [3], met die doel om asimptotiese sy toets
E? Ectiveness op binêre bome van grootte n. Ons het vier modelle vir die studie van die Com
depressie strategie: Twee maniere van meting grootte (óf die aantal blare of Die
diepte van die boom), en twee tipes waarskynlikheidsverdelings (Planar Bome is al
ewe waarskynlik, of al nonplanar Bome is. ewe waarskynlik). Ons Bereken die gemiddelde
kompressie bereik deur Kie er et?. AL se strategie vir 'n paar spesifieke Klasse C voorbeeld
van binêre bome, en dan meer algemeen, gemiddeld oor al (hetsy nonplanar, of
Planar) Bome van 'n binêre vaste grootte n. Die resultate is gevolgtrekkings wat ons gebruik oor te trek
Die soorte bome waarvoor die strategie is E? dat Richtlijn. 'N uiteindelike doel is om te bepaal
Myne Die mate waarin die grootte van die DAG is gekorreleer met die inligting
vervat in die Associated boom.