Construct a 2-connected graph from a connected graph with minimum edge insertion
- From: "hewei" <hewei.com@xxxxxxxxx>
- Date: 5 Oct 2005 06:47:43 -0700
Is there a good algorithm of 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.
.
- Follow-Ups:
- Prev by Date: Re: Cantor
- Next by Date: Best statistics calculator?
- Previous by thread: Re: Short definition of category?
- Next by thread: Re: Construct a 2-connected graph from a connected graph with minimum edge insertion
- Index(es):
