1. Statistical mechanics of complex networks;Albert;Rev. Modern Phys.,2002
2. On vertex, edge, and vertex-edge random graphs;Beer;Electron. J. Combin.,2011
3. Nonparametric edge density estimation in large graphs. Technical report, No FT/RD/TECH/11/02/13;Boullé,2011
4. The Berry–Esseen theorem for U-statistics;Callaert;Ann. Statist.,1978
5. A. Cannon, L. Cowen, Approximation algorithms for the class cover problem, in: Proceedings of the 6th International Symposium on Artificial Intelligence and Mathematics, January 5–7, 2000, Fort Lauderdale, Florida, 2000.