Binary trees with choosable edge lengths
From MaRDI portal
Publication:989581
DOI10.1016/j.ipl.2009.07.002zbMath1200.68173MaRDI QIDQ989581
Dieter Rautenbach, Jens Maßberg
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.07.002
68R10: Graph theory (including graph drawing) in computer science
68P25: Data encryption (aspects in computer science)
Related Items
The repeater tree construction problem, Generalized Huffman coding for binary trees with choosable edge lengths
Cites Work