EB环境下的一个匹配模型及其算法研究

描述了基于相同属性的元素两两重复匹配在实际应用中的具体意义,提出了EB环境下基于相同属性的元素两两重复匹配问题的基本概念,讨论了重复匹配的各种情况和最大重复匹配、最小重复匹配以及平凡匹配的定义和判定准则;分析了最大重复匹配(最小重复匹配)的精确求解算法,得出在m个元素、n种属性的情况下,求解两两最小(最大)重复匹配算法的时间复杂性为Smn的结论;最后提出一个改进算法,其时间复杂性为O(C),改进后的算法还适宜于手工作业。

Research on a Matching Model Based on EB Environment and It' Algorithm

After discussing the real meaning of the problem of item-by-item repeat matchs based on the same attribution possessed, this paper gives a concept of item-by-item repeat matchs based on the same attribution in the EB environment and every cases of the match. The definition of the largest repeating matching, smellest repeating match, general match and their judge rule are also given. A exact solving algorithm is proposed. Its time complexity is analyzed. The result of the algrithm time complexity is nmS. A improving algorithm, the complexity of which is O(C) is also easily operating by manual.