Directed Acyclic Graph Compression of Labelled Trees
Résumé
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.
Article Dans Une Revue
Machine Graphics & Vision
Année : 1999
Publications Loria : Connectez-vous pour contacter le contributeur
https://inria.hal.science/inria-00098908
Soumis le : mardi 26 septembre 2006-08:40:12
Dernière modification le : vendredi 24 mars 2023-14:52:48
Dates et versions
Identifiants
- HAL Id : inria-00098908 , version 1
Citer
Laurent Wendling, A. Paries. Directed Acyclic Graph Compression of Labelled Trees. Machine Graphics & Vision, 1999, 8 (2), pp.169-174. ⟨inria-00098908⟩
Collections
35
Consultations
0
Téléchargements