The Maximum Weight Stable Set Problem in (P6,bull)-Free Graphs

We present a polynomial-time algorithm that finds a maximum weight stable set in a graph that does not contain as an induced subgraph an induced path on six vertices or a bull (the graph with vertices a, b, c, d, e and edges ab, bc, cd, be, ce).

Saved in:
Bibliographic Details
Published inGraph-Theoretic Concepts in Computer Science Vol. 9941; pp. 85 - 96
Main Authors Maffray, Frédéric, Pastor, Lucas
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 01.01.2016
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Algorithm
Bull-free
free
Polynomial time
Stability
Online AccessGet full text

Cover

More Information
Summary:We present a polynomial-time algorithm that finds a maximum weight stable set in a graph that does not contain as an induced subgraph an induced path on six vertices or a bull (the graph with vertices a, b, c, d, e and edges ab, bc, cd, be, ce).
Bibliography:The authors are partially supported by ANR project STINT (reference ANR-13-BS02-0007).
ISBN:9783662535356
3662535351
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-662-53536-3_8