11594 - All Pairs Maximum Flow

All about problems in Volume 115. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

Post Reply
crackerwang
New poster
Posts: 10
Joined: Sun Jan 20, 2008 8:19 am

11594 - All Pairs Maximum Flow

Post by crackerwang » Wed Apr 08, 2009 6:46 am

can anyone give me a hint?

and there is a another similar problem in the warningup II which I also do not know how to solve it.
thx in advance!

f74956227
New poster
Posts: 37
Joined: Sun Jan 27, 2008 1:50 am
Location: Taiwan
Contact:

Re: 11594 All Pairs Maximum Flow

Post by f74956227 » Wed Apr 22, 2009 1:55 am

This problem can be solved by using the "Gomory - HU Tree of minimum cuts" algorithm, you can google for
more information :D .
electron

yiuyuho
A great helper
Posts: 325
Joined: Thu Feb 21, 2002 2:00 am
Location: United States
Contact:

Re: 11594 All Pairs Maximum Flow

Post by yiuyuho » Sat Apr 25, 2009 5:19 pm


Post Reply

Return to “Volume 115 (11500-11599)”