Graph theory problem: find a matching containing the most edges
Maximum cardinality matching is a fundamental problem in graph theory.[1]
We are given a graph G, and the goal is to find a matching containing as many edges as possible; that is, a maximum cardinality subset of the edges such that each vertex is adjacent to at most one edge of the subset. As each edge will cover exactly two vertices, this problem is equivalent to the task of finding a matching that covers as many vertices as possible.
An important special case of the maximum cardinality matching problem is when G is a bipartite graph, whose vertices V are partitioned between left vertices in X and right vertices in Y, and edges in E always connect a left vertex to a right vertex. In this case, the problem can be efficiently solved with simpler algorithms than in the general case.
^West, Douglas Brent (1999), Introduction to Graph Theory (2nd ed.), Prentice Hall, Chapter 3, ISBN 0-13-014400-2
and 21 Related for: Maximum cardinality matching information
Maximumcardinalitymatching is a fundamental problem in graph theory. We are given a graph G, and the goal is to find a matching containing as many edges...
the matching constrained to be have cardinality that of the smaller of the two partitions. Another special case is the problem of finding a maximum cardinality...
literature, the term complete matching is used. Every perfect matching is a maximum-cardinalitymatching, but the opposite is not true. For example, consider the...
the maximum flow in N {\displaystyle N} is equal to the size of the maximummatching in G {\displaystyle G} , and a maximumcardinalitymatching can be...
cycle length, a maximum-cardinality and maximum-weight exchange can be found in polynomial time. For example, to find a maximum-cardinality exchange, given...
included in at least one maximum-cardinalitymatching in the graph. An alternative term is allowed edge. A fundamental problem in matching theory is: given a...
is a perfect fractional matching with weights {1/2, 1/2, 1/2, 1/2, 1}. The problem of finding a maximum-cardinalitymatching in a hypergraph, thus calculating...
is trivial. When k=2, the problem is equivalent to finding a maximumcardinalitymatching, which can be solved in polynomial time. For any k≥3, the problem...
matching (also called: maximum priority matching) is a matching that maximizes the number of high-priority vertices that participate in the matching....
graph theory, the blossom algorithm is an algorithm for constructing maximummatchings on graphs. The algorithm was developed by Jack Edmonds in 1961, and...
to maintain full control of the network is determined by the maximum-cardinalitymatching in the network. From this result, an analytical framework, based...
there exists a matching that saturates all the agents; this can be decided in polynomial time by just finding a maximumcardinalitymatching in the bipartite...
of a set F of edges is the dot product 1E · 1F . Therefore, a maximumcardinalitymatching in G is given by the following integer linear program: Maximize...
equals its cardinality, and dependent if and only if it has greater cardinality than rank. A nonempty set is a circuit if its cardinality equals one plus...
maximum cardinalitymatching. Kőnig's theorem is equivalent to the following: The positivity graph of any bistochastic matrix admits a perfect matching. A...
matching of size n + r {\displaystyle n+r} . A minimum-cost perfect matching in this graph must consist of minimum-cost maximum-cardinalitymatchings...
a convex sum of at most n2-2n+2 perfect matchings. A fractional matching of maximumcardinality (i.e., maximum sum of fractions) can be found by linear...
convert a bipartite graph to a maximumcardinalitymatching Hungarian algorithm: algorithm for finding a perfect matching Prüfer coding: conversion between...
induced matching number of G, denoted μ ( G ) {\displaystyle \mu (G)} , is the largest cardinality of an induced matching in G - a matching that includes...
Global Information