Directed Acyclic Graph Compression of Labelled Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Machine Graphics & Vision Year : 1999

Directed Acyclic Graph Compression of Labelled Trees

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.

Domains

Other [cs.OH]
No file

Dates and versions

inria-00098908 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00098908 , version 1

Cite

Laurent Wendling, A. Paries. Directed Acyclic Graph Compression of Labelled Trees. Machine Graphics & Vision, 1999, 8 (2), pp.169-174. ⟨inria-00098908⟩
35 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More