Maximum Weight Independent Sets in hole- and co-chair-free graphs.

Andreas Brandstädt Vassilis Giakoumakis

Published in: Inf. Process. Lett. (2012)

Keyphrases

maximum weight
independent set
bipartite graph matching
bipartite graph
weighted graph
minimum weight
bipartite matching
graph matching
partial order
association graph
multiscale
np hard
graph theory
spanning tree
minimum spanning tree
dynamic programming
special case