An O(n) Time Algorithm For Maximum Induced Matching In Bipartite Star_123-free Graphs.
Ruzayn QuaddouraPublished in: CoRR (2014)
Keyphrases
- matching algorithm
- learning algorithm
- computational cost
- string matching
- graph matching
- image matching
- search space
- cost function
- similarity measure
- expectation maximization
- objective function
- np hard
- simulated annealing
- dynamic programming
- detection algorithm
- graph partitioning
- approximate matching
- matching score
- undirected graph
- graph model
- optimal solution
- image set
- computational complexity
- preprocessing
- clustering method
- optimization algorithm
- evolutionary algorithm