Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm.

Paulden, Tim, and Smith, David K.. "Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm.." The Electronic Journal of Combinatorics [electronic only] 14.1 (2007): Research Paper R55, 20 p.-Research Paper R55, 20 p.. <http://eudml.org/doc/117184>.

@article{Paulden2007,
author = {Paulden, Tim, Smith, David K.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Prüfer code; linear time algorithms; decoding; string to tree; encoding; tree to string; decoding algorithm; random Prüfer stringrandom mutation},
language = {eng},
number = {1},
pages = {Research Paper R55, 20 p.-Research Paper R55, 20 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm.},
url = {http://eudml.org/doc/117184},
volume = {14},
year = {2007},
}

TY - JOUR
AU - Paulden, Tim
AU - Smith, David K.
TI - Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2007
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 14
IS - 1
SP - Research Paper R55, 20 p.
EP - Research Paper R55, 20 p.
LA - eng
KW - Prüfer code; linear time algorithms; decoding; string to tree; encoding; tree to string; decoding algorithm; random Prüfer stringrandom mutation
UR - http://eudml.org/doc/117184
ER -