Pages that link to "Item:Q1969439"
From MaRDI portal
The following pages link to An efficient algorithm for generating Prüfer codes from labelled trees (Q1969439):
Displaying 8 items.
- Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm (Q1010611) (← links)
- On the locality of the Prüfer code (Q1010914) (← links)
- Efficient Prüfer-like coding and counting labelled hypertrees (Q1022347) (← links)
- Network generation using the Prufer code (Q1088882) (← links)
- Computing Prüfer codes efficiently in parallel (Q1566573) (← links)
- On coding labeled trees (Q2381521) (← links)
- The Reduced Prüfer Code for Rooted Labelled k-Trees (Q3439323) (← links)
- Generating binary trees in A-order from codewords defined on a four-letter alphabet (Q4321109) (← links)