Computing Prüfer codes efficiently in parallel

DOI10.1016/S0166-218X(99)00221-8zbMath0961.68153OpenAlexW2019183885MaRDI QIDQ1566573

Rossella Petreschi, Raymond Greenlaw

Publication date: 25 May 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00221-8

zbMATH Keywords

Prüfer code

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (3)

On coding labeled trees ⋮ Unified parallel encoding and decoding algorithms for Dandelion-like codes ⋮ Efficient Prüfer-like coding and counting labelled hypertrees

Cites Work

• The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
• On the complexity of edge labelings for trees
• An Efficient Parallel Biconnectivity Algorithm
• Parallel Merge Sort
• Parallel Prefix Computation
• Complexity Results for Bandwidth Minimization
• The Parallel Evaluation of General Arithmetic Expressions
• A simple parallel tree contraction algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing Prüfer codes efficiently in parallel