Rainbow Greedy Matching Algorithms

Patrick Bennett, Colin Cooper and Alan Frieze ()
Additional contact information
Patrick Bennett: Western Michigan University
Colin Cooper: King’s College London
Alan Frieze: Carnegie Mellon University

A chapter in Optimization, Discrete Mathematics and Applications to Data Sciences, 2025, pp 33-50 from Springer

Abstract: 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).

Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-78369-2_3

Ordering information: This item can be ordered from
http://www.springer.com/9783031783692

DOI: 10.1007/978-3-031-78369-2_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().