✦ LIBER ✦

A note on traversal algorithms for triply linked binary trees

✍ Scribed by T. I. Fenner; G. Loizou

Publisher: Springer Netherlands
Year: 1981
Tongue: English
Weight: 173 KB
Volume: 21
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01933159

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on optimal area algorithms for up

A note on optimal area algorithms for upward drawings of binary trees

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

A note on genetic algorithms for degree-

A note on genetic algorithms for degree-constrained spanning tree problems

✍ Zhou, Gengui; Gen, Mitsuo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to