摘要
图的可以含有环的对集称为图的伪对集。William 和 Anderson 给出了求图的最大基数伪对集的一个算法。本文给出了求图的最大权伪对集的一个算法,它是 Edmonds 算法的一个推广。
A pseudo matching in a graph is a matching which may have loops. William and Anderson gave an algorithm for finding a pseudo matching of maximum cardinality in a graph.In this paper an algorithm for finding a pseudo matching with maximum weight in a graph is described.It is an ex- tension of Edmonds' algorithm.
出处
《山东大学学报（自然科学版）》
CSCD
1990年第2期148-153,共6页
Journal of Shandong University(Natural Science Edition)
