Independent sets of maximum weight in (p, q)-colorable graphs.

Vladimir E. Alekseev Vadim V. Lozin

Published in: Discret. Math. (2003)

Keyphrases

maximum weight
independent set
bipartite graph matching
bipartite graph
weighted graph
bipartite matching
minimum weight
graph matching
partial order
np hard
association graph
graph theory
upper bound
data structure
graph structure
social networks
computational complexity