A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs.
Nicholas KorpelainenPublished in: Electron. Notes Discret. Math. (2009)
Keyphrases
- matching algorithm
- worst case
- learning algorithm
- optimal solution
- computational complexity
- graph isomorphism
- strongly polynomial
- k means
- detection algorithm
- expectation maximization
- maximum cardinality
- polynomial time complexity
- approximation ratio
- image matching
- probabilistic model
- special case
- semi supervised
- dynamic programming
- convex hull
- matching process
- np hard
- polynomial size
- adjacency graph
- cost function
- search space
- similarity measure