Some concepts of two-part graphs

Dichotomy: Divides the vertices in the graph into two sets X and Y,x with no intersection with the Y set, and the points within the respective set are not connected, and the x set and the Y set form an edge
Binary matching: On the basis of a binary graph, a subset of the set of X y two sets has no common vertices in any of the two edges of the m,m.
Maximum match: called the maximum match when the number of sides in M reaches the upper limit of the two graph
Perfect match: All vertices in a binary graph are on a matching edge, called a perfect match
Augmented path: A path in the diagram that never matches a vertex begins to the end of an unmatched vertex, where the path is alternating between the matched edge and the matched edge
Minimum point overlay: Pick a minimum number of points (can be x| | Y set) so that the points are associated with all edges (covering all edges)
Minimum Edge overlay: Find some edges in the diagram to cover all the vertices in the graph, and any one vertex has and only one edge associated with it.
Maximum independent set: no edges at any two points in the collection, and the number of vertices in the collection reaches the upper limit
Largest group: Any two points in the collection have edges, and the number of vertices in the collection reaches the upper limit

Hungarian algorithm: Every time you look for an augmented path, if you can find a match plus 1

The minimum vertex cover number of a binary graph = Two maximum match number of the graph
Maximum number of independent sets of binary graphs = number of nodes (n)-Maximum number of matches (m)
Maximum group = number of nodes-maximum independent set of complement graphs

Minimum edge coverage = number of nodes (n)-Maximum number of matches (m)

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Some concepts of two-part graphs