conference paper

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel

Geevarghese Philip^a, Ashutosh Rai^b✉, Saket Saurabh^b

^aMax-Planck-Institut für Informatik (MPII), Saarbrücken, Germany
^bThe Institute of Mathematical Sciences, Chennai, India
✉Corresponding author

Lecture notes in computer science Springer Science+Business Media2015-01-01 19 citations19 references

Looking for the full paper…

Export

Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.

Abstract

No abstract is available from our sources. Use “Read paper” to view it.

TL;DRThis paper studies the problem of deleting k-vertices to get into \(\mathcal{F}_l\), \(l\)-pseudoforest Deletion, in the realm of parameterized complexity and designs an algorithm with running time \(7.5618^k n^{{\mathcal {O}}(1)}\). (Semantic Scholar)

Plain-language summary

AI illustration of the topic of “Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel”

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel

Abstract

Plain-language summary

Discussion