A probabilistic analysis of some greedy cardinality matching algorithms |
| |
| Authors: | G. Tinhofer |
| |
| Affiliation: | (1) Institut für Mathematik der Technischen, Universität München, Postfach 20 24 20, D-8000 München 2, Germany |
| |
| Abstract: | ![]()
This paper deals with the expected cardinality of greedy matchings in random graphs. Different versions of the greedy heuristic for the cardinality matching problem are considered. Experimental data and some theoretical results are reported. |
| |
| Keywords: | Random graphs expectation of greedy matchings |
| 本文献已被 SpringerLink 等数据库收录！ |
