Construct a 2-connected graph from a connected graph with minimum edge insertion
2 views
Skip to first unread message
hewei
Oct 5, 2005, 10:15:32 AM10/5/05
to Graph Theory Algorithms
Is there a good algorithm for finding the minimum number of edges
necessary to be inserted into a connected graph G(V,E) so as to make it
2-connected? Assume |V| >= 3.
necessary to be inserted into a connected graph G(V,E) so as to make it
2-connected? Assume |V| >= 3.
Reply all
Reply to author
Forward
0 new messages