Simplifying Calculation of Graph Similarity Through Matrices

Abstract : A method to simplify the calculation in the process of measuring graph similarity is proposed, where lots of redundant operations are avoided in order to quickly obtain the initial tickets matrix. In this proposal, the element value of the initial tickets matrix is assigned to 1 when it is positive in corresponding position of the paths matrix at the first time. The proposed method calculates the initial tickets matrix value based on the positive value in the paths matrix in a forward and backward way. An example is provided to illustrate that the method is feasible and effective.
Type de document :
Communication dans un congrès
9th International Conference on Computer and Computing Technologies in Agriculture (CCTA), Sep 2015, Beijing, China. IFIP Advances in Information and Communication Technology, AICT-479 (Part II), pp.417-428, 2016, Computer and Computing Technologies in Agriculture IX. 〈10.1007/978-3-319-48354-2_41〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01614181
Contributeur : Hal Ifip <>
Soumis le : mardi 10 octobre 2017 - 15:42:11
Dernière modification le : mardi 10 octobre 2017 - 15:53:43
Document(s) archivé(s) le : jeudi 11 janvier 2018 - 14:44:53

Fichier

 Accès restreint
Fichier visible le : 2019-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Xu Wang, Jihong Ouyang, Guifen Chen. Simplifying Calculation of Graph Similarity Through Matrices. 9th International Conference on Computer and Computing Technologies in Agriculture (CCTA), Sep 2015, Beijing, China. IFIP Advances in Information and Communication Technology, AICT-479 (Part II), pp.417-428, 2016, Computer and Computing Technologies in Agriculture IX. 〈10.1007/978-3-319-48354-2_41〉. 〈hal-01614181〉

Partager

Métriques

Consultations de la notice

63