On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes.

Deniss Kumlander

Published in: MCO (2008)

Keyphrases

maximum weight
np hard
learning algorithm
optimal solution
computational complexity
dynamic programming
worst case
knapsack problem
independent set
particle swarm optimization
shortest path
convergence rate
bipartite graph
weighted graph
bipartite matching
bipartite graph matching