An O(n^2.5) Algorithm for Maximum Matching in General Graphs
Shimon EvenOded KarivPublished in: FOCS (1975)
Keyphrases
- learning algorithm
- maximum matching
- objective function
- segmentation algorithm
- matching algorithm
- dynamic programming
- np hard
- clustering algorithm
- randomly generated
- bipartite graph
- detection algorithm
- k means
- preprocessing
- probabilistic model
- linear programming
- special case
- search space
- graph structure
- weighted graph
- similarity measure
- cost function
- semi supervised
- directed graph
- computational complexity
- graph databases
- random graphs
- adjacency graph