Matching (graph theory)

In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Bipartite matching is a special case of a network flow problem.

单词	Maximum matching problem
释义	Maximum matching problem 英语百科 Matching (graph theory) In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Bipartite matching is a special case of a network flow problem.
随便看	Codru的意思 Codrug的意思 codrugs的意思 Codrus的意思 cod的意思 COD sale的意思 COD sales的意思 Codsall的意思 cods hd.的意思 codship的意思 cods wallop的意思 codswallop的意思 codswallop的意思 codulle的意思 Co Durham的意思 Coduri的意思 Cod War的意思 cod war, Cod War的意思 codware的意思 codwell的意思 Cody的意思 codylin的意思 cody pk.的意思 Cody tack operation的意思 Cody, William Frederick的意思

Maximum matching problem

Matching (graph theory)