| 二部图最大权匹配的符号ADD算法 |
| |
| 引用本文： | 姚家保,古天龙,徐周波. 二部图最大权匹配的符号ADD算法[J]. 桂林电子科技大学学报, 2005, 25(3): 42-46 |
| |
| 作者姓名： | 姚家保 古天龙 徐周波 |
| |
| 作者单位： | 桂林电子工业学院,计算机系,广西,桂林,541004;桂林电子工业学院,计算机系,广西,桂林,541004;桂林电子工业学院,计算机系,广西,桂林,541004 |
| |
| 基金项目： | 广西自然科学基金资助项目(0448072) |
| |
| 摘 要： | 利用代数决策图ADD数据结构,在KM算法基础上,提出了一种二部图最大权匹配的符号ADD算法。该算法引入优先函数概念,将传统的匹配选择转化成布尔运算,"并行"地搜索匹配集合。实验结果表明:与传统算法相比,该算法可以改善问题的状态空间复杂度。
|
| 关 键 词： | 二部图 最大权匹配 代数决策图 |
| 文章编号： | 1001-7437(2005)03-42-05 |
| 修稿时间： | 2005-04-07 |
An ADD-based Algorithm for Maximum Weight Matching in Bipartite Graphs |
| |
| YAO Jia-bao,GU Tian-long,XU Zhou-bo. An ADD-based Algorithm for Maximum Weight Matching in Bipartite Graphs[J]. Journal of Guilin University of Electronic Technology, 2005, 25(3): 42-46 |
| |
| Authors: | YAO Jia-bao GU Tian-long XU Zhou-bo |
| |
| Abstract: | Algebraic Decision Diagram is a new efficient approach to solve combinatorial optimization problems. In this paper, according to Kuhn-Munkres algorithm, the authors propose a symbolic algorithm based on ADD data structure for the maximum weight matching in bipartite graphs. By using symbolic manipulations, this algorithm introduces the priority function applied to a "parallel" search for the set of matching. Compared with the traditional algorithms, the experimental results demonstrate that the algorithm can improve state space complexity of the problem. |
| |
| Keywords: | bipartite graphs maximum weight matching ADD (Algebraic Decision Diagram) |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
