An $$\mathcal{O}(m\log n)$$ O ( m log n ) algorithm for the weighted stable set problem in claw-free graphs with $$\alpha ({G}) \le 3$$ α ( G ) ≤ 3