On coding labeled trees

DOI10.1016/j.tcs.2007.03.009zbMath1188.68116OpenAlexW2009905906MaRDI QIDQ2381521

Saverio Caminiti, Irene Finocchi, Rossella Petreschi

Publication date: 18 September 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.009

zbMATH Keywords

data structureslabeled treesGraph algorithmsPrüfer-like codes

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (8)

A statistic related to trees and words on a finite alphabet ⋮ A tutorial on the balanced minimum evolution problem ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ Models of random subtrees of a graph ⋮ Coding Through a Two Star and Super Mean Labeling ⋮ Unified parallel encoding and decoding algorithms for Dandelion-like codes ⋮ Enumerating vertices of the balanced minimum evolution polytope ⋮ Bijective linear time coding and decoding for \(k\)-trees

Cites Work

• A method and two algorithms on the theory of partitions
• Computing Prüfer codes efficiently in parallel
• An efficient algorithm for generating Prüfer codes from labelled trees
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• A note on genetic algorithms for degree-constrained spanning tree problems
• Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
• THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On coding labeled trees