matching (465B)
1 # Matching 2 3 Structure in [graph] et [graph_bipartite]: a subset of edges where no two edges share a vertex 4 5 - [maximum_matching] 6 - [exact_matching] 7 - [perfect_matching] 8 9 Problems: 10 11 - [matching_counting] 12 - [maximum_matching_counting] 13 14 Algorithms [graph_algorithm]: 15 16 - [hungarian_algorithm] 17 18 Also the [linear_relaxation]: see [fractional_edge_packing] 19 20 See also: [independent_set], [induced_matching], [graph_matching_covered], [deficiency] 21 22 Up: [graph_substructure]