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 »

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!
Top
f74956227
New poster
Posts: 37
Joined: Sun Jan 27, 2008 1:50 am
Location: Taiwan
Contact:
Contact f74956227

Re: 11594 All Pairs Maximum Flow

Post by f74956227 »

This problem can be solved by using the "Gomory - HU Tree of minimum cuts" algorithm, you can google for
more information :D .
electron
Top
yiuyuho
A great helper
Posts: 325
Joined: Thu Feb 21, 2002 2:00 am
Location: United States
Contact:
Contact yiuyuho

Re: 11594 All Pairs Maximum Flow

Post by yiuyuho »

Check This:
http://forums.topcoder.com/?module=Thre ... 16&start=0
Top
Post Reply

Return to “Volume 115 (11500-11599)”