摘要： 本文将寻找简单图的最大匹配归结为寻找相应的有约束条件的伪布尔函数的极值,接着将有约束条件的伪布尔函数的极值问题转换为等价的无约束条件的伪布尔函数的极值问题。对于后者,给出了迭代算法及手算实例,最后还讨论了求最大独立集的布尔方法。

Abstract: In this paper, finding maximum matchings of simple graphsis reduced to the maximizalion of corresponding pseudo Boolean function with constraints. which then, being transferred into the maximization of equivalent pseudo-Boolean function wthout constraints. The recurrent algorithm of this transfer is givea, and the Boolean method for finding maximum independent sets is also discusscd.