论文信息 - The average performance of the greedy matching algorithm - 字舞流文

The average performance of the greedy matching algorithm

B. Pittel | A. Frieze | M. Dyer

[1] J. Curtiss. A Note on the Theory of Moment Generating Functions , 1942 .

[2] J. Moon. Counting labelled trees , 1970 .

[3] J. Moon,et al. The expected node-independence number of random trees , 1973 .

[4] B. Korte,et al. An Analysis of the Greedy Heuristic for Independence Systems , 1978 .

[5] Richard M. Karp,et al. Maximum Matchings in Sparse Random Graphs , 1981, FOCS 1981.

[6] Gottfried Tinhofer. A probabilistic analysis of some greedy cardinality matching algorithms , 1984, Ann. Oper. Res..

[7] P. Erdos,et al. On the evolution of random graphs , 1984 .

[8] Hosam M. Mahmoud,et al. Analysis of the Space of Search Trees under the Random Insertion Algorithm , 1989, J. Algorithms.

[9] Boris G. Pittel,et al. On Tree Census and the Giant Component in Sparse Random Graphs , 1990, Random Struct. Algorithms.

[10] Dorit S. Hochbaum,et al. A Fast Perfect-Matching Algorithm in Random Graphs , 1990, SIAM J. Discret. Math..

[11] Martin E. Dyer,et al. Randomized Greedy Matching , 1991, Random Struct. Algorithms.