Thomasse, S, Trotignon, N and Vuskovic, K (2017) A polynomial Turing-kernel for weighted independent set in bull-free graphs. Algorithmica, 77 (3). pp. 619-641. ISSN 0178-4617
Abstract
The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a stable set of size k, when k is part of the instance. Our main result in this paper is to show the existence of an FPT algorithm when we parameterize the problem by the solution size k. A polynomial kernel is unlikely to exist for this problem. We show however that our problem has a polynomial size Turingkernel. More precisely, the hard cases are instances of size O(k5). As a byproduct, if we forbid odd holes in addition to the bull, we show the existence of a polynomial time algorithm for the stable set problem. We also prove that the chromatic number of a bull-free graph is bounded by a function of its clique number and the maximum chromatic number of its triangle-free induced subgraphs. All our results rely on a decomposition theorem for bull-free graphs due to Chudnovsky which is modified here, allowing us to provide extreme decompositions, adapted to our computational purpose.
Metadata
Authors/Creators: |
|
||||
---|---|---|---|---|---|
Copyright, Publisher and Additional Information: | © Springer Science+Business Media New York 2015. This is an author produced version of a paper published in Algorithmica. The final publication is available at Springer via https://doi.org/10.1007/s00453-015-0083-x | ||||
Keywords: | FPT algorithm; Kernel; Turing-kernel; Bull-free graph; Stable set | ||||
Dates: |
|
||||
Institution: | The University of Leeds | ||||
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) | ||||
Funding Information: |
|
||||
Depositing User: | Symplectic Publications | ||||
Date Deposited: | 28 Apr 2016 10:58 | ||||
Last Modified: | 14 Apr 2017 04:43 | ||||
Published Version: | https://doi.org/10.1007/s00453-015-0083-x | ||||
Status: | Published | ||||
Publisher: | Springer | ||||
Identification Number: | https://doi.org/10.1007/s00453-015-0083-x |