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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01614181
Contributor : Hal Ifip <>
Submitted on : Tuesday, October 10, 2017 - 3:42:11 PM
Last modification on : Tuesday, October 10, 2017 - 3:53:43 PM
Long-term archiving on: Thursday, January 11, 2018 - 2:44:53 PM

File

434298_1_En_41_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

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. pp.417-428, ⟨10.1007/978-3-319-48354-2_41⟩. ⟨hal-01614181⟩

Share

Metrics

Record views

148

Files downloads

90