T. Uno. Personal communication. 1999. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The Number of Connected Components in Graphs and Its Applications - Uehara (Correct)
....edges (e 1 ; e 2 ) that means the difference of two spanning trees . That is, when we have a tree T and receive the output (e 1 ; e 2 ) we get the next tree T 0fe 1 g fe 2 g. Using the idea, we can enumerate all k spanning trees and all k connected components of a given graph more efficiently [14]. Acknowledgment I thank Dr. Takeaki Uno, who told me about the efficient enumeration algorithm for k spanning trees. My thanks also to Professor Seinosuke Toda and Dr. Koichi Yamazaki for discussions and encouragement. This research was partially supported by the Ministry of Education, Science, ....
T. Uno. Personal communication. 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC