|
Related articles:
Key terms: algorithm all vertices augmenting path bipartite bipartite graph bipartite matching complexity each edge edge cover edge dominating set edges edmonds exactly examples figure finding finding a minimum flow graph graph theory hence independent set matching matching is a matching matching number matching problem math maximal matching maximum matching minimum minimum edge minimum maximal matching number of perfect matchings path perfect matching polynomial time problem running time setminus size size of a maximum matching solved theorem unmatched v e vertex vertices weighted Search external links cited by footnotes on Wikipedia page Matching: |
|