after readin the posts i come to know the names of some algos... can any one plz give me web addr to know about these algos? [i searched in yahoo but did not find much helpful links.]
Karger's algorithm
Dinic's maxflow algorithm
Stoer and Wagner's algorithm
Thanks in advance.
Mahbub
read ...
Search found 2 matches
- Wed Jun 06, 2007 7:47 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10989 - Bomb, Divide and Conquer
- Replies: 25
- Views: 15544
- Wed Jun 06, 2007 7:29 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10989 - Bomb, Divide and Conquer
- Replies: 25
- Views: 15544
WA on 10989
hi everybody.
I've applied the Stoer-Wagner algo to find the min-edge-cut
but I'm getting WA!
I've tried any kind of test cases... (disconnected graph, containing bridge, complete graph, ....)
is there any tricky test data???
can any one give me some test data plz...
tnx in advance.
I've applied the Stoer-Wagner algo to find the min-edge-cut
but I'm getting WA!
I've tried any kind of test cases... (disconnected graph, containing bridge, complete graph, ....)
is there any tricky test data???
can any one give me some test data plz...
tnx in advance.