Login / Signup
-free subclasses and Maximum Weight Independent Set problem.
T. Karthick
Published in:
Theor. Comput. Sci. (2014)
Keyphrases
</>
independent set
maximum weight
bipartite matching
bipartite graph
minimum weight
maximum independent set
weighted graph
partial order
np hard
random walk