摘要
本文利用王氏代数对用初等树变换生成树的方法进行了改造,提出了一种新的初等树变换的算法。新算法较之原法简洁、直观、运算方便、概念清楚,并保留了原法的所有优点。
This paper advances a new algorithm of the elementary tree transformation which is the improvement upon the old one by means of W—algebra. The new algorithm is more succinct and audio—visual, and it is easier to be operated and clearer in conception. Besides, it continues to have all the advantages of the old one.
出处
《长沙理工大学学报（社会科学版）》
1988年第1期65-70,共6页
Journal of Changsha University of Science and Technology：Social Science
关键词
初等树变换
王氏代数法和基本割集
elementary tree transformation
W—algebra
Fundamental cut set
