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 Jul 2013, Rouen, France. Springer , 468 - 472. ISBN 978-3-642-45277-2
Abstract
We provide a fixed-parameter certifying algorithm for the Vertex-deletion problem. An upper bound for the size of the forbidden set for C+kv is shown demonstrating that, for all hereditary classes characterised by a finite forbidden set, the class C+kv is characterised by a finite forbidden set. The certifying algorithm runs in time O(f(k)·n) and can be verified in O(n) in the affirmative case and O(f(k)) in the negative case. This is the first known fixed-parameter certifying algorithm, as far as the authors are aware.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (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: | 19 Dec 2022 13:26 |
Published Version: | http://dx.doi.org/10.1007/978-3-642-45278-9_45 |
Status: | Published |
Publisher: | Springer |
Identification Number: | 10.1007/978-3-642-45278-9_45 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:78364 |