Directed acylic graph compression of labelled trees

• Autorzy: Paries A. , Wendling L.
• Języki publikacji: EN

Abstrakty

EN

A new algorithm for compressing labelled trees is proposed in the paper. This algorithm allows to obtain a Directed Acyclic Graph (DAG) from a labelled tree in linear time. An experimental study is also given.

Słowa kluczowe

EN

algorithms; labelled tree; compression

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 1999
• Tom: Vol. 8, No. 2
• Strony: 169--174
• Opis fizyczny: Bibliogr. 8 poz.

Twórcy

autor

Paries A.

autor

Wendling L.

• Aquitaine Valley, 7-9 rue René Magne, 33300 Bordeaux, France