A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph.
Joseph F. PeknyDonald L. MillerPublished in: INFORMS J. Comput. (1994)
Keyphrases
- minimum cost
- undirected graph
- spanning tree
- np hard
- approximation algorithms
- network flow
- capacity constraints
- network flow problem
- matching algorithm
- network simplex algorithm
- maximum cardinality
- positive integer
- graph matching
- pattern matching
- random graphs
- strongly connected
- minimum cost flow
- string matching
- minimum weight
- markov chain
- upper bound
- probability distribution
- special case
- optimal solution
- bayesian networks
- image segmentation