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

Andreas Brandstädt Vassilis Giakoumakis

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

Keyphrases

maximum weight
independent set
bipartite graph matching
weighted graph
bipartite graph
bipartite matching
minimum weight
graph matching
partial order
computational complexity
graph structure
np hard
graph theory
spanning tree
minimum spanning tree