Corpus ID: 207930660

A Polynomial Kernel for Funnel Arc Deletion Set

@article{Milani2019APK,
  title={A Polynomial Kernel for Funnel Arc Deletion Set},
  author={Marcelo Garlet Milani},
  journal={ArXiv},
  year={2019},
  volume={abs/1911.05520}
}
  • Marcelo Garlet Milani
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
  • In Directed Feeback Arc Set (DFAS) we search for a set of at most $k$ arcs which intersect every cycle in the input digraph. It is a well-known open problem in parameterized complexity to decide if DFAS admits a kernel of polynomial size. We consider $\mathcal{C}$-Arc Deletion Set ($\mathcal{C}$-ADS), a variant of DFAS where we want to remove at most $k$ arcs from the input digraph in order to turn it into a digraph of a class $\mathcal{C}$. In this work, we choose $\mathcal{C}$ to be the class… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 11 REFERENCES

    Polynomial kernels for deletion to classes of acyclic digraphs

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Kernels for deletion to classes of acyclic digraphs

    VIEW 1 EXCERPT

    Recent developments in kernelization: A survey

    VIEW 1 EXCERPT

    Fundamentals of parameterized complexity, volume

    • Rodney G Downey, Michael R Fellows
    • 2013
    VIEW 1 EXCERPT

    Kernelization - Preprocessing with a Guarantee

    VIEW 1 EXCERPT

    A kernelization algorithm for d-Hitting Set

    VIEW 1 EXCERPT