Author:
Aynulin Rinat,Chebotarev Pavel
Publisher
Springer International Publishing
Reference37 articles.
1. Avrachenkov, K., Chebotarev, P., Rubanov, D.: Kernels on graphs as proximity measures. In: International Workshop on Algorithms and Models for the Web-Graph. LNCS, vol. 10519, pp. 27–41. Springer (2017)
2. Aynulin, R.: Efficiency of transformations of proximity measures for graph clustering. In: International Workshop on Algorithms and Models for the Web-Graph. LNCS, vol. 11631, pp. 16–29. Springer (2019)
3. Bothorel, C., Cruz, J.D., Magnani, M., Micenkova, B.: Clustering attributed graphs: models, measures and methods. Netw. Sci. 3(3), 408–444 (2015)
4. Chebotarev, P.Y., Shamis, E.: On the proximity measure for graph vertices provided by the inverse Laplacian characteristic matrix. In: 5th Conference of the International Linear Algebra Society, Georgia State University, Atlanta, pp. 30–31 (1995)
5. Chebotarev, P.: The walk distances in graphs. Discrete Appl. Math. 160(10–11), 1484–1500 (2012)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献