This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computer science Low‑importance This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles Low This article has been rated as Low-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{ WikiProject Computer science}} Mathematics Low‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles Low This article has been rated as Low-priority on the project's priority scale.

Why does this have its own Wiki article? Is there some other article this can be merged to? I just don't see how this concept warrants an article. Torc2 ( talk) 23:03, 28 November 2007 (UTC) reply

scholar.google.com lists 908 scientific articles mentioning Feedback Vertex Set; 88 have it in their title. It would be easy to fill a whole book with the results. So in my opinion, this concepts does warrant an article. -- Mellum ( talk) 23:28, 29 November 2007 (UTC) reply

OK, I was just legitimately curious - I didn't tag it or nominate it for deletion. It'd be nice to flesh out the section on uses for the function. Torc2 ( talk) 23:42, 29 November 2007 (UTC) reply

I have removed the following sentence from the main article:

In contrast, the problem is polynomial-time solvable on graphs of maximum degree at most three. ^{citation needed}

This statement was initially sourced Cao, Chen & Liu (2010) harvtxt error: no target: CITEREFCaoChenLiu2010 ( help), but is not supported by that reference. Hermel ( talk) 19:35, 27 October 2011 (UTC) reply

The article keeps saying that the optimization version (MINIMUM FVS) is NP-complete. It is not. It is NP-hard. It is the decision problem that is NP-complete.

This is probably happening in other articles as well. 68.5.117.23 ( talk) 01:21, 15 July 2022 (UTC) reply