Date: 11/08/05 (Algorithms)    Keywords: no keywords

Graph Theory:

Why: So in Fleury's Algorithm there is a nice little line that says just don't do that if it's a bridge. but this has to be checked for every edge to be deleted. Where a bridge is an edge whose deletion separates a graph.

Want: an efficient way to check if an edge is a bridge

How:? is there something that runs in less than n^2?

Source: http://www.livejournal.com/community/algorithms/66260.html