Directed Acyclic Graph Compression of Labelled Trees
Identifieur interne : 00AB35 ( Main/Merge ); précédent : 00AB34; suivant : 00AB36Directed 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...)
- to stream Crin, to step Corpus: 002855
- to stream Crin, to step Curation: 002855
- to stream Crin, to step Checkpoint: 001D29
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><idno type="wicri:Area/Main/Merge">00AB35</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></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00AB35 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00AB35 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:wendling99a
|texte= Directed Acyclic Graph Compression of Labelled Trees
}}
| This area was generated with Dilib version V0.6.33. |  |