Sentence examples for maximal matching problem from inspiring English sources

We define the problem of maximal assortativity matching (MAM) as a variant of the maximal matching problem wherein we want to maximize the similarity between the end vertices (with respect to any particular measure for node weight) constituting the matching.

The matching problem for die stacking can be converted into a bipartite graph maximal matching problem and the traditional algorithm can be used to solve this problem.

The experimental evaluation of the algorithms shows that they outperform known OBDD-based algorithms for the maximal matching problem and the minimum spanning tree problem.

We prove that the maximal matching problem within a bipartite graph shown as Figure 5 is tantamount to the RA-CORP problem.

The maximal matching problem, i.e., the computation of a matching that is not a proper subset of another matching, is a fundamental optimization problem, and maximal matching algorithms have been used as submodules for problems like maximal node-disjoint paths or maximum flow.

Therefore, the RA-CORP problem is equivalent to the maximal-matching problem in a bipartite graph as shown in Figure 5. Figure 5 The bipartite graph example showing the association relationship between MNs and RNs.

This was accomplished with LadderFinder, a software constructed ad hoc that tackled this issues as a maximal matching graph problem [ 28].

Implementing these optimal policies involves solving a maximal bipartite matching problem at each scheduling time.

The maximal assortative matching problem has been so far not considered in the literature for bipartite graphs.

This simplification relates the minimum-length scheduling problem to the problem of obtaining a maximal matching in a non-bipartite graph [11].

We refer to the problem of finding a maximal matching with minimum assortative index as the maximal dissortative matching (MDM) problem.