HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

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
Document type :
Journal articles
Complete list of metadata
https://hal.inria.fr/inria-00098908
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:40:12 AM
Last modification on : Friday, February 4, 2022 - 3:34:37 AM

Identifiers

  • HAL Id : inria-00098908, version 1

Collections

INRIA | CNRS | LORIA | UNIV-LORRAINE | INRIA2

Citation

Laurent Wendling, A. Paries. Directed Acyclic Graph Compression of Labelled Trees. Machine Graphics & Vision, Instytut podstaw informatyki (Pologne), 1999, 8 (2), pp.169-174. ⟨inria-00098908⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

33

 

Contact                    Legal Notice                    Personal Data