✦ LIBER ✦

A Near-Linear Area Bound for Drawing Binary Trees

✍ Scribed by T. M. Chan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on optimal area algorithms for up

✍ P. Crescenzi; G. Di Battista; A. Piperno 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 793 KB

A linear algorithm for compact box-drawi

✍ Masud Hasan; Md. Saidur Rahman; Takao Nishizeki 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

A Best Possible Bound for The Weighted P

✍ Mehlhorn, Kurt 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 366 KB

A reconfiguration scheme for yield enhan

✍ Howells, M.C.; Agarwal, V.K. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 709 KB

A Linear Time Lower Bound on McCreight a

✍ Mauricio Ayala-Rincón; Paulo D. Conejo 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 157 KB

A linear time and space algorithm for fi

✍ Erkki Mäkinen 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 216 KB