Talk:Domination analysis
Add topicLatest comment: 19 years ago by Jayvdb in topic Notability
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Untitled
[edit]I thought the dominance number was the size of the smallest dominating set of a given graph. Is this related? Phr 03:21, 4 April 2006 (UTC)
See this for more information and references. --NotQuiteEXPComplete 16:59, 22 August 2006 (UTC)
Notability
[edit]The term "Domination+analysis" only has 535 results. I am concerned that this article fails notability, and that sources will not be able to be found! Also, the IP address that has added this article has recently added 12 pieces of spam between 08:01 and 08:14. John Vandenberg 11:23, 14 November 2006 (UTC)
- I am more interested in the Google scholar results: 106 papers . That seems more than enough to be able to find sources. And in fact the paper already cites some sources, including one from a well respected researcher known for his contributions beyond this subject (Orlin). The search also finds a paper by Noga Alon on the subject , another highly respected researcher in theoretical computer science in general. So I don't see a problem with notability, neither in terms of the number of papers and authors contributing to this area nor in the scholarliness of its contributors. —David Eppstein 15:52, 14 November 2006 (UTC)
- Thanks David; I didnt think to check that. I was concerned that the listed sources may be pushing a term which wasnt notable. Sorry for the noise. John Vandenberg 21:16, 14 November 2006 (UTC)