搜索资源列表
aFastAlgorithmforNon-bipartiteMaximalMatching
- 图论相关算法：a fast algorithm for non-bipartite maximal matching-Graph Theory correlation algorithm: a fast algorithm for non-bipartite maximal matching
Xong
- A matchings in a graph is a set of edges, no two which share an endpoint. In this section we show how to find maximum matchings in bipartite graphs
Bipartite-graph-matching
- 自己的笔记，二分图匹配详解，是用匈牙利算法解的。-Own notes, bipartite graph matching explain, with the Hungarian algorithm solution.
ldpc
- In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel.[1][2] An LDPC is constructed using a sparse bipartite graph.[3] LDPC codes are capa
贪心1004
- Were Tian Ji lives in nowadays, he will certainly laugh at himself. Even more, were he sitting in the ACM contest right now, he may discover that the horse racing problem can be simply viewed as finding the maximum matching in a bipartite graph. Draw