Publisher
Springer International Publishing
Reference15 articles.
1. Babai, L., Erdős, P., Selkow, S.M.: Random graph isomorphism. SIAM J. Comput. 9(3), 628–635 (1980). https://doi.org/10.1137/0209047
2. Bollobás, B.: Random Graphs. Cambridge Studies in Advanced Mathematics, vol. 73, 2nd edn. Cambridge University Press (2001). https://doi.org/10.1017/CBO9780511814068
3. Bollobás, B., Riordan, O.: Coupling scale-free and classical random graphs. Internet Math. 1(2), 215–225 (2003). https://doi.org/10.1080/15427951.2004.10129084
4. Bollobás, B., Riordan, O.: Robustness and vulnerability of scale-free random graphs. Internet Math. 1(1), 1–35 (2003). https://doi.org/10.1080/15427951.2004.10129080
5. Cohen, G.D., Honkala, I.S., Litsyn, S., Lobstein, A.: Covering Codes. North-Holland Mathematical Library, vol. 54. North-Holland (2005)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Anti-stochastic Properties of Unlabeled Graphs;Graph-Theoretic Concepts in Computer Science;2022