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.