Publisher
Springer International Publishing
Reference15 articles.
1. L. Allison, On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs. Technical report 2014/277, Faculty of Information Technology, Monash University, 2014.
http://www.allisons.org/ll/Publications/2014Graph/
2. L. Babai, Graph isomorphism in quasipolynomial time, in Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC) (ACM, New York, 2016), pp. 684–697.
https://doi.org/10.1145/2897518.2897542
3. D. de Solla Price, A general theory of bibliometric and other cumulative advantage processes. J. Am. Soc. Inf. Sci. 27(5), 292–306 (1976).
https://doi.org/10.1002/asi.4630270505
4. P. Erdos, A. Renyi, On random graphs. Publ. Math. 6, 290–297 (1959).
http://www.renyi.hu/~p_erdos/1959-11.pdf
5. B.R. Gaines, Behaviour/structure transformations under uncertainty. Int. J. Man Mach. Stud. 8(3), 337–365 (1976).
https://doi.org/10.1016/S0020-7373(76)80005-3