matching (688B)
1 # Matching 2 3 Structure in [graphs] and [bipartite_graphs]: a subset of [edges] where no two [edges] share a common [vertex] 4 5 - [maximum_matching] 6 - [perfect_matching] 7 8 [Computational_problems]: 9 10 - [matching_problem] 11 - [maximum_matching_problem] 12 - [perfect_matching_problem] 13 - [exact_matching_problem] 14 - [matching_counting] 15 - [maximum_matching_counting] 16 17 [Graph_algorithms]: 18 19 - [hungarian_algorithm] 20 21 Variants: 22 23 - [matching_variants] 24 - [induced_matching] 25 26 Also the [linear_relaxation]: see [fractional_edge_packing] 27 28 See also: [independent_set], [induced_matching], [graph_matching_covered], [deficiency], [partial_bijection], [2_factor] 29 30 Up: [graph_substructure] 31 32 Aliases: matchings