Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size.
Daniel KoblerUdi RoticsPublished in: Algorithmica (2003)
Keyphrases
- graph matching
- maximum cardinality
- subgraph isomorphism
- maximum clique
- matching algorithm
- image matching
- maximum number
- bipartite graph
- association graph
- pattern matching
- matching process
- computational complexity
- multiscale
- attributed relational graph
- graph theoretic
- feature matching
- graph theory
- feature points
- computer vision
- weighted graph
- graph structure
- string matching
- random graphs
- finding similar
- shape matching
- keypoints