A 1-matching blossom-type algorithm for edge covering problems.
Katta G. MurtyClovis PerinPublished in: Networks (1982)
Keyphrases
- matching algorithm
- learning algorithm
- benchmark problems
- matching process
- optimal solution
- detection algorithm
- np hard
- k means
- expectation maximization
- neural network
- significant improvement
- preprocessing
- cost function
- high accuracy
- linear programming
- optimization algorithm
- pattern matching
- image matching
- computational complexity
- recognition algorithm
- graph structure
- iterative algorithms
- gray value
- string matching
- undirected graph
- test problems
- objective function
- combinatorial optimization
- lower bound
- computational cost
- experimental evaluation