Affiliation:
1. École Polytechnique Fédérale de Lausanne (EPFL)
2. Università di Roma “Tor Vergata”
3. Grenoble INP
Abstract
We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in
O
(|
V
|(|
E
| + |
V
| log|
V
|))-time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free graphs, which is also introduced in the present article. Despite being weaker than the structural results for claw-free graphs given by Chudnovsky and Seymour [2005, 2008a, 2008b] our decomposition theorem is, on the other hand, algorithmic, that is, it is coupled with an
O
(|
V
||
E
|)-time algorithm that actually produces the decomposition.
Funder
Progetto di Eccellenza 2008–2009 of the Fondazione
Cassa di Risparmio di Padova e Rovigo
German Research Foundation (DFG)
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献