On Tue, Apr 29, 2014 at 10:33 PM, atul anand <[email protected]>wrote:
> find articulation point in graph > It won't work. Say there are N nodes and every node is connected to every other node. This graph does not have any articulation point. You need to remove more than one vertex in this case. You don't know which vertex, you don't know what order. I can't say for sure whether this problem is NP-complete but I don't see how SCC works here. On 29 Apr 2014 16:56, "shashi kant" <[email protected]> wrote: > >> Problem is as follows: >> >> 1. Given a connected graph. >> 2. Remove a vertex out of it and if graph is divided into two components >> return that vertex. >> 3. else find a set of vertices to be removed that will divide graph into >> more than 1 component. >> >> >> >> Please Help me out here .. probably min-cut problem >> http://www.geeksforgeeks.org/minimum-cut-in-a-directed-graph/ is >> suitable here. >> >> >> *Thanks & Regards,* >> *Shashi Kant * >> *"Think positive and find fuel in failure"* >> http://thinkndoawesome.blogspot.com/ >> *Senior Software Engineer* >> *Samsung Research India Bangalore .* >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To unsubscribe from this group and stop receiving emails from it, send an >> email to [email protected]. >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].
