Sciweavers

IPL
2000
97views more  IPL 2000»
13 years 10 months ago
A fast algorithm for computing large Fibonacci numbers
We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci ...
Daisuke Takahashi
DAM
2007
81views more  DAM 2007»
13 years 10 months ago
Graphs, partitions and Fibonacci numbers
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
Arnold Knopfmacher, Robert F. Tichy, Stephan Wagne...