An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $α({G}) \le 3$.
Paolo NobiliAntonio SassanoPublished in: CoRR (2015)
Keyphrases
- worst case
- detection algorithm
- high accuracy
- computational complexity
- dynamic programming
- k means
- computational cost
- np hard
- theoretical analysis
- learning algorithm
- cost function
- preprocessing
- optimization algorithm
- times faster
- recognition algorithm
- linear programming
- clustering method
- expectation maximization
- experimental evaluation
- significant improvement
- search space
- search algorithm
- optimal solution
- tree structure
- convergence rate
- graph structure
- knn
- particle swarm optimization
- graphical models
- simulated annealing
- upper bound
- probabilistic model
- evolutionary algorithm
- lower bound
- objective function
- similarity measure