Talk:Aanderaa–Karp–Rosenberg conjecture
Latest comment: 12 years ago by David Eppstein in topic Meaningless example
This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||
|
Redirect from Evasiveness
editI have arrived on this article from ICD-10 Chapter XVIII: Symptoms, signs and abnormal clinical and laboratory findings by way of the redirect Evasiveness. While both subjects interest me, surely this is not a desired pattern. -- Rama (talk) 07:45, 29 October 2011 (UTC)
Meaningless example
editAs a graph is, by definition, a set of vertices and edges, checking if a graph is empty is equivalent to check if the edges set is empty, constant time. This result should not vary between data structure representations. What about removing that weird example ? Or at least, make it true. Because for the moment, it is meaningless (at least to me). — Preceding unsigned comment added by 82.234.106.160 (talk) 19:00, 22 January 2012 (UTC)
- You didn't read the first sentence of the artickle, did you? Specifically the part about only having access to the graph via questions of the form "Is there an edge between vertex u and vertex v?" —David Eppstein (talk) 19:09, 22 January 2012 (UTC)