matching (540B)
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 - [perfect_matching] 7 8 Problems: 9 10 - [matching_counting] 11 - [maximum_matching_counting] 12 13 Algorithms [graph_algorithm]: 14 15 - [hungarian_algorithm] 16 17 Variants: 18 19 - [matching_variants] 20 - [induced_matching] 21 - [exact_matching] 22 23 Also the [linear_relaxation]: see [fractional_edge_packing] 24 25 See also: [independent_set], [induced_matching], [graph_matching_covered], [deficiency] 26 27 Up: [graph_substructure] 28 29 Aliases: matchings