Publisher
Springer Nature Switzerland
Reference22 articles.
1. Anand, K., Bianconi, G.: Entropy measures for networks: toward an information theory of complex topologies. Phys. Rev. E 80(4), 045102 (2009)
2. Anand, K., Bianconi, G., Severini, S.: Shannon and Von Neumann entropy of random networks with heterogeneous expected degree. Phys. Rev. E 83(3), 036109 (2011)
3. Borgwardt, K., Ghisu, E., Llinares-López, F., O’Bray, L., Rieck, B., et al.: Graph kernels: state-of-the-art and future challenges. Found. Trends® Mach. Learn. 13(5–6), 531–712 (2020)
4. Borgwardt, K.M., Kriegel, H.P.: Shortest-path kernels on graphs. In: Fifth IEEE International Conference on Data Mining (ICDM 2005), pp. 8-pp. IEEE (2005)
5. Costa, F., De Grave, K.: Fast neighborhood subgraph pairwise distance kernel. In: ICML (2010)