Pages that link to "Item:Q1566573"
From MaRDI portal
The following pages link to Computing Prüfer codes efficiently in parallel (Q1566573):
Displaying 6 items.
- Unified parallel encoding and decoding algorithms for Dandelion-like codes (Q666249) (← links)
- On the locality of the Prüfer code (Q1010914) (← links)
- Efficient Prüfer-like coding and counting labelled hypertrees (Q1022347) (← links)
- An extension of the Prüfer code and assembly of connected graphs from their blocks (Q1401560) (← links)
- An efficient algorithm for generating Prüfer codes from labelled trees (Q1969439) (← links)
- On coding labeled trees (Q2381521) (← links)