Node Matching Computation Between Two Large Graphs in Linear Computational Cost.
Pep SantacruzShaima AlgabliFrancesc SerratosaPublished in: GbRPR (2017)
Keyphrases
- computational cost
- graph matching
- subgraph isomorphism
- directed graph
- matching process
- graph structure
- maximum cardinality
- finding the shortest path
- matching algorithm
- square root
- association graph
- undirected graph
- pattern matching
- computational effort
- computational complexity
- graph matching algorithm
- shortest path
- reduce the computational cost
- integral image
- graph mining
- graph theory
- search tree
- neural network
- median graph
- small world networks
- graph theoretic
- tree nodes
- matching scheme
- closed form
- weighted graph
- tree structure
- edit distance
- image matching