The maximum weight perfect matching problem for complete weighted graphs is in PC.

Constantine N. K. Osiakwan Selim G. Akl

Published in: SPDP (1990)

Keyphrases

maximum weight
weighted graph
minimum weight
shortest path
independent set
bipartite graph matching
graph structure
minimum spanning tree
data objects
graph connectivity
spanning tree
regularization framework
feature space
np hard
graph matching
discrete data