An ${\cal O}(n\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $α(G) \ge 4$.
Paolo NobiliAntonio SassanoPublished in: CoRR (2015)
Keyphrases
- times faster
- experimental evaluation
- optimization algorithm
- worst case
- computational complexity
- learning algorithm
- theoretical analysis
- particle swarm optimization
- high accuracy
- np hard
- cost function
- tree structure
- preprocessing
- optimal solution
- similarity measure
- detection algorithm
- matching algorithm
- graph isomorphism
- lower bound
- objective function
- segmentation algorithm
- dynamic programming
- significant improvement
- shortest path
- search space
- graph mining
- weighted majority
- social networks