Abstract：The paper presents a method to generate all possible spanning trees of a connected linear graph. By tearing a big connected linear graph into two pieces and then adding border lines one by one we can generate all possible spanning trees. This method be suitable for to computer parallel computation and computer aided analysis of a large network.
收稿日期: 1996-01-25
引用本文:
朱绍文 黄徽. 计算全部树的撕裂算法[J]. , 1996, 35(1): 0-0.
朱绍文 黄徽. AN RIPPING ARITHMETIC TO COUNT ALL TREES. , 1996, 35(1): 0-0.
