Rainbow Greedy Matching Algorithms
arXiv (Cornell University)(2023)
摘要
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).
更多查看译文
关键词
algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要