A Polynomial Kernel for Funnel Arc Deletion Set.
From MaRDI portal
Publication:6089658
DOI10.4230/LIPICS.IPEC.2020.13OpenAlexW3117660523MaRDI QIDQ6089658FDOQ6089658
Authors:
Publication date: 13 November 2023
Full work available at URL: http://arxiv.org/pdf/1911.05520.pdf
Recommendations
- A polynomial kernel for funnel arc deletion set
- Polynomial kernels for deletion to classes of acyclic digraphs
- Polynomial kernels for deletion to classes of acyclic digraphs
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- Towards a polynomial kernel for directed feedback vertex set
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Fundamentals of parameterized complexity
- A kernelization algorithm for \(d\)-hitting set
- Kernelization -- preprocessing with a guarantee
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Recent developments in kernelization: a survey
- Parameterized algorithms
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- Kernelization. Theory of parameterized preprocessing
- Kernels for deletion to classes of acyclic digraphs
- Polynomial kernels for deletion to classes of acyclic digraphs
- Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS
- Efficient algorithms for measuring the funnel-likeness of DAGs
This page was built for publication: A Polynomial Kernel for Funnel Arc Deletion Set.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089658)
