Corpus ID: 32772414

A note on the complexity of Feedback Vertex Set parameterized by mim-width

@article{Jaffke2017ANO,
  title={A note on the complexity of Feedback Vertex Set parameterized by mim-width},
  author={Lars Jaffke and O-joung Kwon and Jan Arne Telle},
  journal={ArXiv},
  year={2017},
  volume={abs/1711.05157}
}
  • Lars Jaffke, O-joung Kwon, Jan Arne Telle
  • Published in ArXiv 2017
  • Mathematics, Computer Science
  • We complement the recent algorithmic result that Feedback Vertex Set is XP-time solvable parameterized by the mim-width of a given branch decomposition of the input graph [3] by showing that the problem is W[1]-hard in this parameterization. The hardness holds even for linear mim-width, as well as for H-graphs, where the parameter is the number of edges in H. To obtain this result, we adapt a reduction due to Fomin, Golovach and Raymond [2], following the same line of reasoning but adding a new… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Citations

    Publications citing this paper.
    SHOWING 1-5 OF 5 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-5 OF 5 REFERENCES

    On the parameterized complexity of multiple-interval graph problems

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    Fellows , Danny Hermelin , Frances Rosamond , and Stéphane Vialette . On the parameterized complexity of multiple - interval graph problems

    • R Michael
    • Theoretical Computer Science
    • 2009