Sentence examples for maximum matchings in from inspiring English sources

In this paper, we present coarse grained parallel graph algorithms with small message overheads that solve the following standard graph problems related to graph matching: finding maximum matchings in convex bipartite graphs, and finding maximum weight matchings in trees.

The size and number of maximum matchings in a network have found a large variety of applications in many fields.

Our results indicate that power-law degree distribution alone is not sufficient to characterize the size and number of maximum matchings in scale-free networks.

In this paper, we study analytically the maximum matchings in two scale-free networks with identical degree sequence, and show that the first network has no perfect matchings, while the second one has many.

As a ubiquitous property of diverse real systems, power-law degree distribution was shown to have a profound influence on size of maximum matchings in scale-free networks, where the size of maximum matchings is small and a perfect matching often does not exist.

MDMSs are determined by detecting maximum matchings in the HLMN (see Methods).

The critical links appear in all the maximum matchings; the redundant links never appear in any maximum matching; and the ordinary links appear in some but not all maximum matchings.

We also restate the problem in terms of the norm of the perturbation of the zeros (rather than the coefficients) of the input polynomials, which leads us to the fast certified solution for any pair of input polynomials via the computation of their roots and the maximum matchings or connected components in the associated bipartite graph.

A proposition has been given in [ 68]: given the bipartite network G p = (X+, X-, E), a link belongs to some of but not all maximum matchings (ordinary), iff, for an arbitrary maximum matching M, it belongs to either an even simple path which begins at a free node, or an even simple cycle.

An example to find maximum matchings and detect MDMSs is shown in Figure 6.

Although the critical, ordinary and redundant links are defined based on all the maximum matchings, they can be determined based on their topological properties in the bipartite network with an arbitrary maximum matching.