Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm
From MaRDI portal
Publication:1010611
zbMath1182.94064MaRDI QIDQ1010611
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117184
decodingencodingdecoding algorithmlinear time algorithmsPrüfer coderandom Prüfer stringrandom mutationstring to treetree to string
Related Items (1)
This page was built for publication: Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm