3 search results - page 1 / 1 » Spanning forests and the golden ratio |
DAM
2008
13 years 4 months ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
MFCS
2009
Springer
13 years 9 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
ISCAPDCS
2004
13 years 6 months ago
2004
This paper describes a collaboration among computer scientists, dancers, and musicians on a production entitled "Fibonacci and Phi." Thematically, the production explore...