The higher-order matching polynomial of a graph.
Oswaldo AraujoMario EstradaDaniel A. MoralesJuan RadaPublished in: Int. J. Math. Math. Sci. (2005)
Keyphrases
- higher order
- graph matching
- low order
- maximum matching
- pairwise
- matching algorithm
- subgraph isomorphism
- maximum cardinality
- random walk
- bipartite graph
- markov random field
- higher order relations
- pattern matching
- graph theory
- maximum weight
- graph structure
- attributed relational graph
- natural images
- association graph
- stable set
- weighted graph
- markov models
- graph representation
- feature points
- matching process
- directed graph
- high order
- image matching
- social networks
- edit distance
- relational structures
- shape matching
- image segmentation
- graph mining
- object recognition
- graph matching algorithm
- keypoints
- similarity scores
- graph theoretic
- spanning tree
- graph model
- feature matching