An ${\cal O}(n^2 \log(n))$ algorithm for the weighted stable set problem in claw-free graphs.
Paolo NobiliAntonio SassanoPublished in: CoRR (2015)
Keyphrases
- learning algorithm
- experimental evaluation
- matching algorithm
- preprocessing
- detection algorithm
- dynamic programming
- worst case
- high accuracy
- recognition algorithm
- objective function
- weighted graph
- optimization algorithm
- segmentation algorithm
- theoretical analysis
- graph structure
- k means
- computational complexity
- expectation maximization
- graph mining
- weighted distance
- graph isomorphism
- convergence rate
- times faster
- linear programming
- probabilistic model
- computational cost
- significant improvement
- clustering algorithm