Polynomial kernels for deletion to classes of acyclic digraphs

DOI10.4230/LIPICS.STACS.2016.55MaRDI QIDQ4601907zbMATHOpenAlexFDO

Authors Matthias Mnich, Erik Jan van Leeuwen

Publication date 24 January 2018

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.STACS.2016.55

zbMATH Keywords

kernelsparameterized algorithmsdirected feedback vertex/arc set

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Polynomial kernels for deletion to classes of acyclic digraphs
• Kernels for deletion to classes of acyclic digraphs
• Kernels for deletion to classes of acyclic digraphs
• Parameterised algorithms for deletion to classes of DAGs
• Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments

Cited in

(10)

• A polynomial kernel for bipartite permutation vertex deletion
• scientific article; zbMATH DE number 6704650 (Why is no real title available?)
• A polynomial kernel for funnel arc deletion set
• A Polynomial Kernel for Funnel Arc Deletion Set.
• Kernels for deletion to classes of acyclic digraphs
• Parameterised algorithms for deletion to classes of DAGs
• A polynomial kernel for block graph deletion
• Kernels for deletion to classes of acyclic digraphs
• On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion
• Polynomial kernels for deletion to classes of acyclic digraphs

This page was built for publication: Polynomial kernels for deletion to classes of acyclic digraphs

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