A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs.
Christoph BrausePublished in: Discret. Appl. Math. (2017)
Keyphrases
- computational cost
- dynamic programming
- objective function
- detection algorithm
- optimal solution
- computational complexity
- k means
- graph structure
- probabilistic model
- graph isomorphism
- minimum spanning tree
- tree structure
- np hard
- cost function
- search space
- graphical models
- segmentation algorithm
- worst case
- clustering method
- matching algorithm
- greedy algorithm
- graph theory
- evolutionary algorithm