Linear Time Parameterized Algorithms for Subset Feedback Vertex Set

@inproceedings{Lokshtanov2015LinearTP,
  title={Linear Time Parameterized Algorithms for Subset Feedback Vertex Set},
  author={Daniel Lokshtanov and M. S. Ramanujan and Saket Saurabh},
  booktitle={ICALP},
  year={2015}
}
In the Subset Feedback Vertex Set (Subset FVS) problem, the input is a graph G on n vertices and m edges, a subset of vertices T , referred to as terminals, and an integer k. The objective is to determine whether there exists a set of at most k vertices intersecting every cycle that contains a terminal. The study of parameterized algorithms for this generalization of the Feedback Vertex Set problem has received significant attention over the last few years. In fact the parameterized complexity… CONTINUE READING
17 Citations
44 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 44 references

Graph Theory

  • R. Diestel
  • Springer-Verlag, Heidelberg, 4th ed.
  • 2010
Highly Influential
4 Excerpts

Half-integrality

  • M. Wahlström
  • LP-branching and FPT algorithms, in SODA
  • 2014

Similar Papers

Loading similar papers…