Rainbow Greedy Matching Algorithms
Combinatorics
2023-07-04 v1
Abstract
We consider the problem of finding a large rainbow matching in a random graph with randomly colored edges. In particular we analyze the performance of two greedy algorithms for this problem. The algorithms we study are colored versions of algorithms that were previously used to find large matchings in random graphs (i.e. the color-free version of our present problem).
Cite
@article{arxiv.2307.00657,
title = {Rainbow Greedy Matching Algorithms},
author = {Patrick Bennett and Colin Cooper and Alan Frieze},
journal= {arXiv preprint arXiv:2307.00657},
year = {2023}
}