搜索资源列表
Maximum.matching.algorithm.in.general.graph.o(n^3
- A matching on a graph is a set of edges, no two of which share a vertex.
General-graph-matching
- ACM竞赛中 一般图的最大匹配 带花树-ACM contest the general graph maximum matching with trees and flowers. . . .