An FPT certifying algorithm for the vertex-deletion problem

DOI10.1007/978-3-642-45278-9_45MaRDI QIDQ2870064zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Haiko Müller, Samuel Wilson

Publication date 17 January 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45278-9_45

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Faster parameterized algorithm for cluster vertex deletion
• An FPT algorithm for tree deletion set
• Chordal Deletion Is Fixed-Parameter Tractable
• An FPT algorithm for Tree Deletion Set
• Chordal deletion is fixed-parameter tractable

This page was built for publication: An FPT certifying algorithm for the vertex-deletion problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870064)