Sentence examples for a matching with from inspiring English sources

(There are various ways to find the maximum matching. See, e.g, [12].) A maximum matching is a matching with the largest possible number of edges.

The problem of finding a matching with the minimum number of blocking pairs is NP-hard, and it is hard to approximate [19].

A matching of a graph is an independent subset of the edges set and a maximum matching is a matching with as many edges in it as possible.

For k=2 the k-clique matching problem reduces to the well-known and extensively studied problem of matching in graphs; a matching in a graph is defined as any subset of nonadjacent edges, which basically are cliques of size 2. In unweighted graphs, matching problems concentrate on finding a maximum matching (a matching with the largest number of edges).

Section 7 presents a modification of the maximal assortativity matching algorithm (referred to as the maximal dissortative matching algorithm, MDM) to determine a matching with an objective of minimizing the assortativity index and presents results of execution of the MDM algorithm on network graphs considered in Sects.

A maximum matching is a matching with maximum size.

Cue a match with Intercontinental Champion Wade Barrett.

This was a match with no compromises.

"We just didn't have a match with the Mets.

They found a match with X-rays of the neck.

England arrived in Perth today for a match with destiny.