Login / Signup
An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs.
Mrinmoy Hota
Madhumangal Pal
Tapan Kumar Pal
Published in:
Comput. Optim. Appl. (2001)
Keyphrases
</>
independent set
maximum weight
dynamic programming
minimum weight
bipartite graph
bipartite matching
learning algorithm
particle swarm optimization
optimal solution
np hard
tree structure
weighted graph
average case
multi class
graph structure
perceptron algorithm
computational complexity
social networks