An 𝒪 (m log n) algorithm for the weighted stable set problem in claw-free graphs with α(G) ≤ 3.
Paolo NobiliAntonio SassanoPublished in: Math. Program. (2017)
Keyphrases
- experimental evaluation
- computational complexity
- improved algorithm
- k means
- objective function
- matching algorithm
- detection algorithm
- dynamic programming
- high accuracy
- learning algorithm
- worst case
- optimal solution
- np hard
- lower bound
- linear programming
- particle swarm optimization
- expectation maximization
- theoretical analysis
- preprocessing
- data streams
- times faster
- recognition algorithm
- graph model
- minimum spanning tree
- polynomial time complexity