A polynomial kernel for funnel arc deletion set

DOI10.1007/s00453-022-00960-wOpenAlexW2987747206MaRDI QIDQ2161012

Marcelo Garlet Milani

Publication date: 3 August 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.05520

zbMATH Keywords

kernelsparameterized algorithmgraph editingfunnelsdirected feedback arc set

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
• Fundamentals of parameterized complexity
• A kernelization algorithm for \(d\)-hitting set
• 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
• Kernelization – Preprocessing with a Guarantee
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Kernelization
• Parameterized Algorithms
• Efficient algorithms for measuring the funnel-likeness of DAGs

This page was built for publication: A polynomial kernel for funnel arc deletion set