| 能力集扩展的表格方法 |
| |
| 引用本文： | 冯俊文.能力集扩展的表格方法[J].天津大学学报(英文版),2001,7(2):101-108. |
| |
| 作者姓名： | 冯俊文 |
| |
| 作者单位： | 南京理工大学经济管理学院, |
| |
| 基金项目： | Supported by National Natural Science Foundation of China(No.79870 0 30 ) |
| |
| 摘 要： | 每个具有非对称权重的有向图均可用一个称为“扩展表”的矩阵或表格来表示 .讨论了扩展表中的“圈”和“生成表”的概念及其基本特性 ,给出了一种寻找有向图最小生成树的表格方法——最小生成表法 .研究了最小生成表算法在最优能力集扩展问题中的应用 ,给出了一个算法的具体示例 ,并分析了有关的需研究的问题和可能的拓展
|
| 关 键 词： | 能力集扩展 习惯领域 生成表 最小生成树 有向图 |
TABLE BASED METHOD FOR COMPETENCE SET EXPANSION |
| |
| FENG Jun-wen.TABLE BASED METHOD FOR COMPETENCE SET EXPANSION[J].Transactions of Tianjin University,2001,7(2):101-108. |
| |
| Authors: | FENG Jun-wen |
| |
| Abstract: | Each directed graph with the asymmetric costs defined over its arcs,can be represented by a table,which we call an expansion table.The basic properties of cycles and spanning tables of the expansion table corresponding to the cycles and spanning trees of the directed graph is first explored.An algorithm is then derived to find a minimum spanning table corresponding to a minimum spanning tree in the directed graph.Finally,how to use the algorithm to find the optimal expansion of competence set and related problems are discussed. |
| |
| Keywords: | competence set expansion habitual domains spanning tables minimum spanning tree directed graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
