If the graph is planar and you have it's embedding, then you can do better than O(N), at least on a random graph. Otherwise this has to be impossible because the graph gives you no information, and you must look at each vertex.
On Jan 5, 1:17 pm, dabbcomputers <[email protected]> wrote: > you are given with N points on graph. and a point A on graph and range > R you have to find the points that lies within the radius of R from > point A. with complexity less than O(N). -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
