Maximum weight stable set in (P7, bull)-free graphs and (S1,2,3, bull)-free graphs

We give a polynomial time algorithm that finds the maximum weight stable set in a graph that does not contain an induced path on seven vertices or a bull (the graph with vertices a,b,c,d,e and edges ab,bc,cd,be,ce). With the same arguments we also give a polynomial algorithm for any graph that does...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 341; no. 5; pp. 1449 - 1458
Main Authors Maffray, Frédéric, Pastor, Lucas
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.05.2018
Elsevier
Subjects
([formula omitted], bull)-free
Combinatorics
Computer Science
Discrete Mathematics
Mathematics
Maximum weight stable set problem
Polynomial algorithm
(S1,2,3,bull)-free
Polynomial algorithm
Maximum weight stable set problem
(P7, bull)-free
Online AccessGet full text

Cover

More Information
Summary:We give a polynomial time algorithm that finds the maximum weight stable set in a graph that does not contain an induced path on seven vertices or a bull (the graph with vertices a,b,c,d,e and edges ab,bc,cd,be,ce). With the same arguments we also give a polynomial algorithm for any graph that does not contain S1,2,3 or a bull.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2017.10.004