The maximum weight stable set problem in \((P_6,\mbox{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 inarXiv.org
Main Authors Maffray, Frédéric, Pastor, Lucas
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 22.02.2016
Subjects
Algorithms
Apexes
Computer Science - Discrete Mathematics
Graph theory
Mathematics - Combinatorics
Polynomials
Weight
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\)).
ISSN:2331-8422
DOI:10.48550/arxiv.1602.06817