首页 | 本学科首页   官方微博 | 高级检索  
     检索      


An $$\mathcal{O}(m\log n)$$ algorithm for the weighted stable set problem in claw-free graphs with $$\alpha ({G}) \le 3$$
Authors:Nobili  Paolo  Sassano  Antonio
Institution:1.Dipartimento di Ingegneria dell’Innovazione, Università del Salento, Lecce, Italy
;2.Dipartimento di Ingegneria Informatica, Automatica e Gestionale “Antonio Ruberti”, Università di Roma“Sapienza”, Roma, Italy
;
Abstract:Mathematical Programming - In this paper we show how to solve the Maximum Weight Stable Set Problem in a claw-free graph G(V, E) with $$\alpha (G) \le 3$$ in time $$\mathcal{O}(|E|\log...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号