| Article ID: | iaor20041754 |
| Country: | China |
| Volume: | 32 |
| Issue: | 6 |
| Start Page Number: | 973 |
| End Page Number: | 978 |
| Publication Date: | Nov 2002 |
| Journal: | Mathematics in Practice and Theory |
| Authors: | Zhai Xiaoyan |
In this paper, we study the properties of the spanning incoming tree in a digraph network, and propose a simple algorithm for finding the minimum spanning incoming tree in a digraph network. We also present an example for applying this algorithm.