On the Complexity of Matching Cut in Graphs of Fixed Diameter.
Hoàng-Oanh LeVan Bang LePublished in: ISAAC (2016)
Keyphrases
- graph matching
- image matching
- matching algorithm
- association graph
- matching scheme
- space complexity
- neural network
- relational structures
- fixed number
- edit distance
- shape matching
- decision problems
- feature points
- graph structure
- matching process
- worst case
- pairwise
- object recognition
- pattern recognition
- subgraph isomorphism
- data sets
- graph matching algorithm