On graphs with polynomially solvable maximum-weight clique problem.
Egon BalasChang Sung YuPublished in: Networks (1989)
Keyphrases
- maximum weight
- polynomially solvable
- np hard
- independent set
- weighted graph
- bipartite graph
- np complete
- special case
- bipartite matching
- minimum weight
- processing times
- minimum cost
- approximation algorithms
- scheduling problem
- optimal solution
- spanning tree
- linear programming
- partial order
- minimum spanning tree
- lower bound
- branch and bound algorithm
- association graph
- computational complexity
- graph matching
- knapsack problem
- graph theory
- undirected graph
- edge weights
- minimum cost flow
- shortest path
- training data