Current location - Training Enrollment Network - Mathematics courses - What does it mean to be included in discrete mathematics?
What does it mean to be included in discrete mathematics?
This will talk about the problem of complete bipartite graph in graph theory.

Inclusive maximum matching should mean maximum matching (edge independent set).

Explain in detail:

Where the component is an independent set (no two vertices are adjacent)

(sum of weights

Those edges associated with vertices of a component) are the sum of edge weights in independent sets.

A set of edges in an independent set is called an edge independent set (also called matching).