| 基于混合超图的最小覆盖,闭包求解算法研究 |
| |
| 引用本文： | 郝忠孝. 基于混合超图的最小覆盖,闭包求解算法研究[J]. 计算机研究与发展, 1996, 33(10): 770-774 |
| |
| 作者姓名： | 郝忠孝 |
| |
| 作者单位： | 齐齐哈尔轻工学院 |
| |
| 摘 要： | 文中讨论了基于混合超图的有关冗余消除的部分定理，完善了这一理论。并给出了最小覆盖，闭包求解的新算法，进行了相关算法分析。
|
| 关 键 词： | 混合超图 闭包 超图 算法 数据库 |
RESEARCH ON ALGORITHMS TO FIND OUT MINIMUM COVER AND CLOSURE BASED ON MIXED HYPERGRAPH |
| |
| Hao Zhongxiao. RESEARCH ON ALGORITHMS TO FIND OUT MINIMUM COVER AND CLOSURE BASED ON MIXED HYPERGRAPH[J]. Journal of Computer Research and Development, 1996, 33(10): 770-774 |
| |
| Authors: | Hao Zhongxiao |
| |
| Abstract: | In this paper,some theorems relevant to eliminating redundancy based on a mixed hypergraph are discussed and the theory is improved.New algorithms to find out minimum cover and closure are given and the relevant algorithms are analyzed. |
| |
| Keywords: | Mixed hypergraph redundancy minimum cover closure. |
| 本文献已被 CNKI 维普 等数据库收录！ |
