Funder
National Science Foundation
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference9 articles.
1. Distinguishing vertices of random graphs;Bollobás;Ann. Discrete Math.,1982
2. A probabilistic proof of an asymptotic formula for the number of labelled graphs;Bollobás;Eur. J. Comb.,1980
3. Canonical labelling of graphs in linear average time;Babai,1979
4. Perfect matchings in random r-regular, s-uniform hypergraphs;Cooper;Comb. Probab. Comput.,1996
5. The fast approximation solution of hard combinatorial problems;Karp,1975
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献