暂无分享,去创建一个
[1] M. Stephanov,et al. Random Matrices , 2005, hep-ph/0509286.
[2] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[3] Harriet Ortiz,et al. Proceedings of the twenty-second annual ACM symposium on Theory of computing , 1990, STOC 1990.
[4] Alan M. Frieze,et al. Perfect matchings in random graphs with prescribed minimal degree , 2003, SODA '03.
[5] Joel H. Spencer,et al. Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.
[6] B. Pittel,et al. Maximum matchings in sparse random graphs: Karp-Sipser revisited , 1998 .
[7] N. Wormald. The differential equation method for random graph processes and greedy algorithms , 1999 .
[8] M. Sipser,et al. Maximum matching in sparse random graphs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[9] A. RÉNY,et al. ON THE EXISTENCE OF A FACTOR OF DEGREE ONE OF A CONNECTED RANDOM GRAPH , 2004 .
[10] G. V. Balakin. On Random Matrices , 1967 .
[11] T. Kurtz. Solutions of ordinary differential equations as limits of pure jump markov processes , 1970, Journal of Applied Probability.
[12] B. Pittel,et al. The average performance of the greedy matching algorithm , 1993 .
[13] P. Erdos,et al. On the existence of a factor of degree one of a connected random graph , 1966 .
[14] Nikhil R. Devanur,et al. Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching , 2013, SODA.
[15] Gagan Goel,et al. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations , 2010, SODA.
[16] D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .
[17] Joan Feigenbaum,et al. On graph problems in a semi-streaming model , 2005, Theor. Comput. Sci..
[18] M I C H A E L M I T Z E N M A C H,et al. Studying Balanced Allocations with Differential Equations † , 1999 .
[19] Claire Mathieu,et al. On-line bipartite matching made simple , 2008, SIGA.
[20] Alan M. Frieze,et al. Perfect matchings in random bipartite graphs with minimal degree at least 2 , 2005, Random Struct. Algorithms.
[21] Prabhakar Raghavan,et al. Computing on data streams , 1999, External Memory Algorithms.
[22] Aranyak Mehta,et al. AdWords and Generalized On-line Matching , 2005, FOCS.
[23] N. Wormald. Differential Equations for Random Processes and Random Graphs , 1995 .