An FPT certifying algorithm for the vertex-deletion problem

Muller, H and Wilson, S (2013) An FPT certifying algorithm for the vertex-deletion problem. In: Lecroq, T and Mouchard, L, (eds.) Combinatorial Algorithms, 24th International Workshop, IWOCA 2013, Revised Selected Papers. 24th International Workshop, IWOCA 2013, 10-12 July 2013, Rouen, France. Springer , 468 - 472. ISBN 978-3-642-45277-2

Abstract

Metadata

Authors/Creators:
  • Muller, H
  • Wilson, S
Dates:
  • Published: 2013
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 08 Aug 2014 11:07
Last Modified: 03 Nov 2016 03:31
Published Version: http://dx.doi.org/10.1007/978-3-642-45278-9_45
Status: Published
Publisher: Springer
Identification Number: https://doi.org/10.1007/978-3-642-45278-9_45

Share / Export

Statistics