Another one is heuristic branch - and - bound algorithm , and this algorithm just work well in moderate size 另一个算法是启发式的分支界定算法,但该算法仅仅在中等规模的二分图中可行。
In the skeleton matching , an novel approach based on weighted optimal bipartite graph matching theory is also presented 在骨架匹配方面,论文提出了一种基于加权最优二分图匹配技术的骨架匹配技术。
The model is build up by using the theory of fuzzy synthesized evaluation , the theory of binary chart matching , and data searching results 应用模糊综合评价理论、二分图匹配原理和最大数值搜索法等理论建立择优录用的模型。
But the classical vertex cover algorithm can not use in the cbvc problem directly , because the cbvc problem have more term need to constraint 但是,以上的算法并不能直接应用于受二分图约束的顶点覆盖问题( constraintbipartitevertexcover , cbvc )求解。