Directed Acyclic Graph Compression of Labelled Trees
Identifieur interne : 001D29 ( Crin/Checkpoint ); précédent : 001D28; suivant : 001D30Directed Acyclic Graph Compression of Labelled Trees
Auteurs : Laurent Wendling ; A. PariesSource :
- Machine Graphics & vision ; 1999.
English descriptors
- KwdEn :
Abstract
A new algorithm for compressing labelled trees is proposed in this paper. This algorithm allows to obtain a directed acyclic graph (DAG) from a labelled tree in linear time.
Links toward previous steps (curation, corpus...)
Links to Exploration step
CRIN:wendling99aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="96">Directed Acyclic Graph Compression of Labelled Trees</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:wendling99a</idno>
<date when="1999" year="1999">1999</date>
<idno type="wicri:Area/Crin/Corpus">002855</idno>
<idno type="wicri:Area/Crin/Curation">002855</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002855</idno>
<idno type="wicri:Area/Crin/Checkpoint">001D29</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001D29</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Directed Acyclic Graph Compression of Labelled Trees</title>
<author><name sortKey="Wendling, Laurent" sort="Wendling, Laurent" uniqKey="Wendling L" first="Laurent" last="Wendling">Laurent Wendling</name>
</author>
<author><name sortKey="Paries, A" sort="Paries, A" uniqKey="Paries A" first="A." last="Paries">A. Paries</name>
</author>
</analytic>
<series><title level="j">Machine Graphics & vision</title>
<imprint><date when="1999" type="published">1999</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>compresssion</term>
<term>labelled trees</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="755">A new algorithm for compressing labelled trees is proposed in this paper. This algorithm allows to obtain a directed acyclic graph (DAG) from a labelled tree in linear time.</div>
</front>
</TEI>
<BibTex type="article"><ref>wendling99a</ref>
<crinnumber>99-R-397</crinnumber>
<category>1</category>
<equipe>ISA</equipe>
<author><e>Wendling, Laurent</e>
<e>Paries, A.</e>
</author>
<title>Directed Acyclic Graph Compression of Labelled Trees</title>
<journal>Machine Graphics & vision</journal>
<year>1999</year>
<volume>8</volume>
<number>2</number>
<pages>169-174</pages>
<month>Nov</month>
<keywords><e>compresssion</e>
<e>labelled trees</e>
</keywords>
<abstract>A new algorithm for compressing labelled trees is proposed in this paper. This algorithm allows to obtain a directed acyclic graph (DAG) from a labelled tree in linear time.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001D29 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd -nk 001D29 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Checkpoint |type= RBID |clé= CRIN:wendling99a |texte= Directed Acyclic Graph Compression of Labelled Trees }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |