Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs.
Andrzej GrzesikTereza KlimosováMarcin PilipczukMichal PilipczukPublished in: CoRR (2017)
Keyphrases
- independent set
- maximum weight
- computational complexity
- bipartite matching
- minimum weight
- weighted graph
- dynamic programming
- objective function
- special case
- polynomial time complexity
- worst case
- partial order
- np hard
- bipartite graph
- convergence rate
- simulated annealing
- optimal strategy
- minimum spanning tree
- optimal solution