Author:
Karoński Michał,Pittel Boris
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Maximum matchings in a class of random graphs;Frieze;J. Combin. Theory B,1986
2. On perfect matchings and hamiltonian cycles in sums of random trees;Frieze;SIAM J. Discrete Math.,1999
3. Average case analysis of a heuristic for the assignment problem;Karp;Math. Oper. Res.,1994
4. Matching Theory;Lovàsz,1986
5. The expected node-independence number of random trees;Meir;Nederl. Akad. Wetensch. Proc. Ser. Indag. Math.,1974
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献