A polynomial Turing-kernel for weighted independent set in bull-free graphs

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

Metadata

Authors/Creators:
  • Thomasse, S
  • Trotignon, N
  • Vuskovic, K
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:
  • Published: March 2017
  • Accepted: 16 October 2015
  • Published (online): 16 November 2015
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRCEP/K016423/1
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

Share / Export

Statistics