Results 1  10
of
4,919
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 702 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
Unique Maximum Matching Algorithms
, 2002
"... We consider the problem of testing the uniqueness of maximum matchings, both in the unweighted and in the weighted case. For the unweighted case, we have two results. First, given a graph with n vertices and m edges, we can test whether the graph has a unique perfect matching, and find it if it exis ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We consider the problem of testing the uniqueness of maximum matchings, both in the unweighted and in the weighted case. For the unweighted case, we have two results. First, given a graph with n vertices and m edges, we can test whether the graph has a unique perfect matching, and find
The labeled maximum matching problem
, 2008
"... Given a graph G where a label is associated with each edge, we address the problem of looking for a maximum matching of G using the minimum number of different labels, namely the Labeled Maximum Matching Problem. It is a relatively new problem whose application is related to the timetabling problem ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Given a graph G where a label is associated with each edge, we address the problem of looking for a maximum matching of G using the minimum number of different labels, namely the Labeled Maximum Matching Problem. It is a relatively new problem whose application is related to the timetabling problem
On Maximum Matchings and Minimum Stars
, 1998
"... We discuss properties and values of maximum matchings and minimum median problems for finite point sets. In particular, we consider "minimum stars", which are defined by a choosing a center, such that the total geometric distance to all the points in the set is minimized. Since the cent ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We discuss properties and values of maximum matchings and minimum median problems for finite point sets. In particular, we consider "minimum stars", which are defined by a choosing a center, such that the total geometric distance to all the points in the set is minimized. Since
Evolutionary Algorithms and the Maximum Matching Problem
, 2002
"... Randomized search heuristics like evolutionary algorithms are mostly applied to problems whose structure is not completely known but also to combinatorial optimization problems. Practitioners report surprising successes but almost no results with theoretically wellfounded analyses exist. Such a ..."
Abstract

Cited by 72 (10 self)
 Add to MetaCart
. Such an analysis is started in this paper for a fundamental evolutionary algorithm and the wellknown maximum matching problem. It is
Searching Randomly for Maximum Matchings
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 76 (2004)
, 2004
"... Many realworld optimization problems in, e. g., engineering or biology have the property that not much is known about the function to be optimized. This excludes the application of problemspecific algorithms. Simple randomized search heuristics are then used with surprisingly good results. In ord ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
purpose is to develop methods for the analysis of general randomized search heuristics. The maximum matching problem is well suited for this approach since long augmenting paths do not allow local improvements and since our results on randomized local search and simple evolutionary algorithms can
THE NUMBER OF MAXIMUM MATCHINGS IN A TREE
"... Abstract. We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) m(T) of a tree T of given order. While the trees that attain the lower bound are easily characterised, the trees with largest number of maximum matchings show a very subtle stru ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) m(T) of a tree T of given order. While the trees that attain the lower bound are easily characterised, the trees with largest number of maximum matchings show a very subtle
Results 1  10
of
4,919