On Thu, 16 Sep 2004 19:51:15 -0700, Paul G. Brown wrote:
> Jan Hidders <jan.hidders_at_REMOVETHIS.pandora.be> wrote in message
> news:<pan.2004.09.16.20.29.41.91351_at_REMOVETHIS.pandora.be>...
>
>> The usual way of showing this is by translating it to the problem of
>> finding the maximal flow in a certain network and solving it with the
>> Ford-Fulkerson method.
>
> Edmonds and Karp dear, Edmonds and Karp.
Ah, yes, of course, FF can be exponential. Just checking if you guys were
paying attention. *cough* :-)
Received on Fri Sep 17 2004 - 13:32:54 CDT
