On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem.

Andreas Brandstädt Chính T. Hoàng

Published in: Theor. Comput. Sci. (2007)

Keyphrases

maximum weight
independent set
bipartite graph
weighted graph
minimum weight
bipartite matching
partial order
spanning tree
np hard
bipartite graph matching
undirected graph
minimum spanning tree
graph matching
edge weights
graph structure
directed graph
graph cuts
optimization problems