Login / Signup
Maximum weight independent sets in hole- and dart-free graphs.
Manu Basavaraju
L. Sunil Chandran
T. Karthick
Published in:
Discret. Appl. Math. (2012)
Keyphrases
</>
maximum weight
independent set
bipartite graph matching
bipartite graph
weighted graph
minimum weight
bipartite matching
graph matching
partial order
np hard
metaheuristic
association graph
learning algorithm
optimization problems
shortest path
minimum spanning tree