A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs

Details A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs

2012-03-19

arxiv.org/abs/1203.4117v1

Computer Science

Data Structures and Algorithms

Scientific paper

We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random graphs with constant expected degree c>0, independent of the value of c. This is contrary to the behavior of commonly used greedy matching heuristics which are known to have some range of c where they probably fail to compute a maximum matching.

Affiliated with

Also associated with

No associations

Rating

A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-212774