✦ LIBER ✦

An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees

✍ Scribed by H. -C. Chen; Y. -L. Wang

Book ID: 105915364
Publisher: Springer
Year: 2000
Tongue: English
Weight: 87 KB
Volume: 33
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s002249910006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalized enumeration of labeled tre

A generalized enumeration of labeled trees and reverse Prüfer algorithm

✍ Seunghyun Seo; Heesung Shin 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 126 KB

An efficient distributed algorithm for g

An efficient distributed algorithm for generating and updating multicast trees

✍ Luca Gatani; Giuseppe Lo Re; Salvatore Gaglio 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 377 KB

An efficient algorithm for computation o

An efficient algorithm for computation of shape moments from run-length codes or chain codes

✍ Mo Dai; Pierre Baylou; Mohamed Najim 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 509 KB

An efficient algorithm for generating B-

An efficient algorithm for generating B-spline interpolation curves and surfaces from B-spline approximations

✍ Wang, Hui Ping ;Hewgill, Denton E. ;Vickers, Geoffrey W. 📂 Article 📅 1990 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 302 KB 👁 1 views

A useful and simple algorithm is presented for interactively generating B-spline interpolation curves and surfaces from B-spline approximation solutions. The difference between the data points and the B-spline approximation is used to modify the control vertices in order to generate a succession of