The Maximum Weight Perfect Matching Problem for Complete Weighted Graphs Is in Pc*.

Constantine N. K. Osiakwan Selim G. Akl

Published in: Parallel Algorithms Appl. (1995)

Keyphrases

maximum weight
weighted graph
minimum weight
bipartite graph matching
independent set
shortest path
graph structure
data objects
edge weights
spanning tree
regularization framework
discrete data
multimedia
active learning
approximation algorithms
minimum spanning tree