๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Spanning forests and the golden ratio

โœ Scribed by Pavel Chebotarev

Book ID
108112703
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
161 KB
Volume
156
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

cover
The Golden Ratio
โœ McCade, Cole ๐Ÿ“‚ Fiction ๐Ÿ“… 2019 ๐ŸŒ English โš– 457 KB

**ABOUT THIS EPISODE** The boys are back, and an old face from Seong-Jaes past plunges BPD Detectives Malcolm Khalaji and Seong-Jae Yoon from a two-month suspension right into the depths of hell and into one of the most horrific, grisly cases of Malcolms life. He's never seen anything like

The Golden Ratio
The Golden Ratio
โœ Livio, Mario ๐Ÿ“‚ Fiction ๐Ÿ“… 2002 ๐Ÿ› Crown Publishing Group ๐ŸŒ English โš– 6 MB
Periodicity and the golden ratio
Periodicity and the golden ratio
โœ Filippo Mignosi; Antonio Restivo; Sergio Salemi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 983 KB

We prove a periodicity theorem on words that has strong analogies with the Critical Factorization theorem. The Critical Factorization theorem states, roughly speaking, a connection between local and global periods of a word; the local period at any position in the word is there defined as the shorte

Minimal ratio spanning trees
Minimal ratio spanning trees
โœ R. Chandrasekaran ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 323 KB
Fixed topology Steiner trees and spannin
Fixed topology Steiner trees and spanning forests
โœ Wang Lusheng; Xiaohua Jia ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 731 KB

We present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with various time-delay constraints. We study the spanning forest problem with bandwidth constraint. A polynomial-time algorithm is given. Those problems have applications in network communications.