Directed Acyclic Graph Compression of Labelled Trees

Laurent Wendling 1 A. Paries
1 ISA - Models, algorithms and geometry for computer graphics and vision
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Mots-clés : compression labelled trees compresssion
Type de document :
Article dans une revue
Machine Graphics and vision, 1999, 8 (2), pp.169-174
Liste complète des métadonnées
https://hal.inria.fr/inria-00098908
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:40:12
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00098908, version 1

Collections

INRIA | LORIA | UNIV-LORRAINE

Citation

Laurent Wendling, A. Paries. Directed Acyclic Graph Compression of Labelled Trees. Machine Graphics and vision, 1999, 8 (2), pp.169-174. 〈inria-00098908〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

65

Contact


archive-ouverte@inria.fr