I think this algorithm is used for calculating poset in graph. On Sat, Jun 16, 2012 at 3:04 AM, Hemesh Singh <[email protected]>wrote:
> + 1 for DK's solution. Is that a standard algorithm coz I feel like I have > heard it somewhere ?? > > > On Mon, Aug 8, 2011 at 1:37 AM, DK <[email protected]> wrote: > >> @KK: DFS and BFS are O(N) and Floyd Warshall is O(N^3). >> Could you please state how you can use the traversals directly to get the >> center? (And prove your correctness too?) >> >> The solution given by Wladimir (& expanded upon by me) is O(N) and uses >> (somewhat) the inverse of a BFS as a traversal. >> >> -- >> DK >> >> http://twitter.com/divyekapoor >> http://gplus.to/divyekapoor >> http://www.divye.in >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To view this discussion on the web visit >> https://groups.google.com/d/msg/algogeeks/-/HnMOZtOrkqwJ. >> >> 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. >> > > > > -- > Hemesh singh > > -- > 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. > -- 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.
