An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Exact and Approximate Graph Matching Using Random Walks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Edit distance-based kernel functions for structural pattern classification
Pattern Recognition
A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs
ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Hi-index | 0.00 |
The Conductance Electrical Model (CEM) transforms a graph into a circuit and can be use to do "inexact graph isomorphism" as it was shown in [13]. In second stage of this process, we transform the circuit req in a star circuit, using the Moore---Penrose pseudo---inverse of a matrix for which there is a general formula that requires transpose, multiply and invert matrices with a time complexity of O(N4), where N is the number of nodes of the graph. However, due to the special structure of the star transformation, we are able to exploit this special structure to compute the pseudo---inverse without using the general Moore---Penrose formula. We have developed a closed formula that can compute the elements of the pseudo---inverse without using that formula, that means without multiplying matrices neither doing the matrix inversion and that moreover can be computed in O(N3). This method also eliminates the problems due to computer rounding and due to bad---conditioned problems in mathematical terms.