On coding labeled trees☆
Under an Elsevier user license
open archive
Keywords
Graph algorithms
Labeled trees
Prüfer-like codes
Data structures
Cited by (0)
- ☆
Work supported in part by the Italian Ministry of University and Scientific Research (project “ALINWEB: Algorithmics for Internet and the Web”) and by the University of Rome “La Sapienza” (project “Parallel and Distributed Codes”). A preliminary version of this work appeared in the Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN’04) [S. Caminiti, I. Finocchi, R. Petreschi, A unified approach to coding labeled trees, in: Proceedings of the 6th Latin American Symposium on Theoretical Informatics, in: LNCS, vol. 2976, 2004, pp. 339–348].
Copyright © 2007 Elsevier Ltd. All rights reserved.