Jump to content

Talk:Feedback vertex set

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Notability?

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]

Statement removed from main article

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), but is not supported by that reference. Hermel (talk) 19:35, 27 October 2011 (UTC)[reply]

NP-hard vs NP-complete

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]

This likely does happen in other articles, but shouldn't be a problem any more in this one. 2603:8001:3D00:6BD:E199:A58B:72C0:97CF (talk) 01:31, 19 April 2025 (UTC)[reply]