An Efficient Distributed Algorithm for Maximum Matching in General Graphs.
Michael M. WuMichael C. LouiPublished in: Algorithmica (1990)
Keyphrases
- maximum matching
- learning algorithm
- optimal solution
- detection algorithm
- computationally efficient
- probabilistic model
- objective function
- bipartite graph
- preprocessing
- matching algorithm
- worst case
- segmentation algorithm
- np hard
- simulated annealing
- special case
- k means
- computational complexity
- graph structure
- similarity measure
- dynamic programming
- markov chain
- expectation maximization
- pairwise
- graph partitioning
- adjacency graph