Sentence examples for maximum matching problem from inspiring English sources

If the edges of a bipartite graph have weights, the maximum matching problem would be about determining the set of matching edges (no two edges in the set have overlapping vertices) such that the sum of the edge weights is the maximum.

Here we formulate the problem into a maximum matching problem (which can be solved in polynomial time) instead of the binary integer linear programming approach (which can be NP-hard in the worst case).

The previous researches that focused on the maximum matching problem violated the specifications in IEEE 802.16 standard, and are thus unpractical.

Then the scheduling problems specified by (3) and (4) correspond to the classical Maximum Weighted Matching Problem (MWMP) and the Maximum Matching Problem (MMP), respectively.

The maximum matching problem for bipartite graphs could be optimally solved using well-known polynomial-time algorithms such as the Edmonds Karp algorithm [22].

A number of researchers regarded this problem as a maximum matching problem and attempted to determine the optimal matches between bursts and subchannels [3 8].

In this talk, we consider a multi-objective variant of the maximum weight matching problem, which is a classical combinatorial optimization problem with numerous applications.

For a given, we can obtain a throughput-optimal scheduling policy by solving the well-known maximum weighted matching problem.

Unlike the case of a multidimensional assignment problem, efficient algorithms exist that solve (9) in polynomial time such as maximum weight matching problem on bipartite graph [15].

Since can be arbitrarily large ForMWKVMPgraph correspondsn, toe performance rathe can be arbitrarily small.

The simplest version, known as maximum circular matching problem, accounts for base pairing energies only [ 10, 11].