Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
Given attribute set and minimum cover set of functional dependencies over one relational schema, a new method for designing normalized XML schemas based on schema graph is proposed.
在给定关系模式的属性集及其函数依赖最小覆盖集的基础上，提出一种基于模式图的规范化XML模式设计方法。
Meanwhile, several relational concepts are defined, and the full and necessary condition under which the standard FDs set becomes a minimum cover, and other problems are discussed.
同时，还定义了与它相关的几个概念，讨论了标准FD集f成为最小覆盖的充要条件及其它问题。
Meanwhile, several relational concepts are defined, and the full and necessary condition under which the standard FDs set becomes a minimum cover, and other problems are discussed.
同时，还定义了与它相关的几个概念，讨论了标准FD集f成为最小覆盖的充要条件及其它问题。
应用推荐