Talk:Aanderaa–Karp–Rosenberg conjecture

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

Mid

This article has been rated as Mid-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

	Mathematics portal 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
Low	This article has been rated as Low-priority on the project's priority scale.

Redirect from Evasiveness

I 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)[reply]

Meaningless example

As 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)[reply]

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)[reply]