Straight-line drawings of binary trees with linear area and arbitrary aspect ratio.
Garg, Ashim, Rusu, Adrian (2004)
Journal of Graph Algorithms and Applications
Similarity:
Garg, Ashim, Rusu, Adrian (2004)
Journal of Graph Algorithms and Applications
Similarity:
Bonichon, Nicolas, Gavoille, Cyril, Hanusse, Nicolas (2005)
Journal of Graph Algorithms and Applications
Similarity:
Kurt Mehlhorn (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Tony W. Lai, Derick Wood (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Paulo E. D. Pinto, Fábio Protti, Jayme L. Szwarcfiter (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Motivated by a problem posed by Hamming in 1980, we define even codes. They are Huffman type prefix codes with the additional property of being able to detect the occurrence of an odd number of 1-bit errors in the message. We characterize optimal even codes and describe a simple method for constructing the optimal codes. Further, we compare optimal even codes with Huffman codes for equal frequencies. We show that the maximum encoding in an optimal even code is at most two bits larger...
Dionisio Pérez-Brito, Nenad Mladenović, José A. Moreno-Pérez (1998)
The Yugoslav Journal of Operations Research
Similarity:
Helen Cameron, Derick Wood (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
Nardelli, Enrico, Proietti, Guido, Widmayer, Peter (2001)
Journal of Graph Algorithms and Applications
Similarity: