| 确定基本补划分的简捷方法—“组合比较法” |
| |
| 引用本文： | 康泰兆,孙宪君,钱建平. 确定基本补划分的简捷方法—“组合比较法”[J]. 南京理工大学学报(自然科学版), 1985, 0(1) |
| |
| 作者姓名： | 康泰兆 孙宪君 钱建平 |
| |
| 作者单位： | 华东工学院电工教研室(康泰兆,孙宪君),华东工学院电工教研室(钱建平) |
| |
| 摘 要： | 本文对W·K·Chen提出的用集合基本补划分的概念,通过分解,无重复地产生全部树的方法作了扼要的介绍,然后着重提出一个产生集合的全部基本补划分的新方法,我们取名为“组合比较法”。该法简单、直观,有规律性,而且完全可以用观察法正确地写出全部基本补划分,因此,可以做为W·K·Chen提出的确定基本补划分算法的补充和改进。
|
| 关 键 词： | 网络分析 代数拓朴学 |
A Simple and Effective Method for Determining Essential Complementary partitions-"Combinationand Comparison method" |
| |
| Kang Taizhao,Sun Xianjun,Qian Jianping. A Simple and Effective Method for Determining Essential Complementary partitions-"Combinationand Comparison method"[J]. Journal of Nanjing University of Science and Technology(Nature Science), 1985, 0(1) |
| |
| Authors: | Kang Taizhao Sun Xianjun Qian Jianping |
| |
| Affiliation: | Kang Taizhao;Sun Xianjun;Qian Jianping |
| |
| Abstract: | This paper illustrates briefly the concept of the essentialcomplementary partitions of a set proposed by W. K. Chen.The concept enablesto generate all of trees without duplication through docomposing the networkunder consideration.Then a new method is given for accomplishing it.It isnamed "Combination and Comparison method",by which all essential comple-mentary partitions can be found systematically by inspoction and it issimpler and easier of observation than Chen's algorithm, so it may beconsidered as a supplement to and improvement of the latter one. |
| |
| Keywords: | Network Analysis Algebraic Topology |
| 本文献已被 CNKI 等数据库收录！ |
|
