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 <>
Submitted on : Tuesday, September 26, 2006 - 8:40:12 AM
Last modification on : Friday, February 26, 2021 - 3:28:04 PM

Identifiers

  • HAL Id : inria-00098908, version 1

Collections

INRIA | CNRS | LORIA | UNIV-LORRAINE

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

Share

Metrics

Record views

96

 

Contact                    Legal Notice                    Personal Data