A O(|V|*|E|) algorithm for maximum matching of graphs.
Tiko KamedaJ. Ian MunroPublished in: Computing (1974)
Keyphrases
- maximum matching
- k means
- bipartite graph
- computational complexity
- learning algorithm
- detection algorithm
- preprocessing
- graph structure
- objective function
- matching algorithm
- segmentation algorithm
- expectation maximization
- worst case
- dynamic programming
- cost function
- np complete
- orders of magnitude
- particle swarm optimization
- normal form
- adjacency graph