Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3.
Zhihao HuiJunfeng DuShipeng WangLiming XiongXiaojing YangPublished in: Discret. Math. (2020)
Keyphrases
- graph matching
- matching algorithm
- pairwise
- edit distance
- string similarity
- subgraph isomorphism
- string matching
- graph matching algorithm
- feature matching
- attributed relational graph
- maximum cardinality
- similarity scores
- topological information
- pattern matching
- graph theoretic
- random graphs
- computer vision
- object recognition
- np complete
- matching process
- graph partitioning
- image matching
- data sets
- matching scheme
- shape matching
- matching score
- relational structures
- graph mining
- strongly connected
- approximate matching
- association graph
- feature points
- graph structure
- pattern recognition
- bipartite graph