Document Open Access Logo

A Naive Algorithm for Feedback Vertex Set

Author Yixin Cao

Thumbnail PDF


  • Filesize: 497 kB
  • 9 pages

Document Identifiers

Author Details

Yixin Cao

Cite AsGet BibTex

Yixin Cao. A Naive Algorithm for Feedback Vertex Set. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Open Access Series in Informatics (OASIcs), Volume 61, pp. 1:1-1:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)


Given a graph on n vertices and an integer k, the feedback vertex set problem asks for the deletion of at most k vertices to make the graph acyclic. We show that a greedy branching algorithm, which always branches on an undecided vertex with the largest degree, runs in single-exponential time, i.e., O(c^k n^2) for some constant c.
  • greedy algorithm
  • analysis of algorithms
  • branching algorithm
  • parameterized computation -- graph modification problem


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail