Affiliation:
1. Department of Mathematical Sciences; Carnegie Mellon University; Pittsburgh Pennsylvania 15217
Subject
Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software
Reference23 articles.
1. The first occurrence of Hamilton cycles in random graphs;Ajtai;Ann Discrete Math,1985
2. Fast probabilistic algorithms for Hamilton circuits and matchings;Angluin;J Comput Syst Sci,1979
3. Maximum matchings in sparse random graphs: Karp-Sipser re-visited;Aronson;Random Struct Algor,1998
4. D. Bal P. Bennett T. Bohman A. M. Frieze A greedy algorithm for finding a large 2-matching on a random cubic graph
5. Hamilton cycles in 3-out;Bohman;Random Struct Algor,2009
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献