基于混合超图的最小覆盖、闭包求解算法研究
RESEARCH ON ALGORITHMS TO FIND OUT MINIMUM COVER AND CLOSURE BASED ON MIXED HYPERGRAPH
-
摘要: 文中讨论了基于混合超图的有关冗余消除的部分定理,完善了这一理论。并给出了最小覆盖、闭包求解的新算法,进行了相关算法分析。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.
下载: