Hi guys!
I have got a very interesting problem ... well for me it's hard....
An undirect graph G. N (N<=300) vertices and M (M<=N*(N+1)/2) edges (i connects to j means j connects to i);.. It's a connected graph!... There's a positive K>0..
The problem is choose k edge(s) and delete them from the ...
Search found 3 matches
- Wed Sep 08, 2004 7:12 am
- Forum: Algorithms
- Topic: A graph Problem
- Replies: 0
- Views: 909
- Mon Aug 02, 2004 1:22 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10130 - SuperSale
- Replies: 76
- Views: 36024
- Sat Jun 05, 2004 6:26 pm
- Forum: Algorithms
- Topic: Strong_conectivity
- Replies: 0
- Views: 994
Strong_conectivity
I need some strong conectivity problems to solve. Can you give me list of those problems? Thank in advance.