Push relabel modification to show used paths (maxflow problem)

From: Mirko Knoll (soundman_at_gmx.de)
Date: 11/12/04

  • Next message: tchow_at_lsa.umich.edu: "Re: [OT]: Another claim for P=NP & UOTPS is delta_2^p complete" 
    Date: 12 Nov 2004 01:22:19 -0800

    I'm currently trying to implement Goldberg's push relabel algorithm
    (PRF from http://www.avglab.com/andrew/soft.html) into our
    environment. But there are some points where I need advice:

    - how do I have to modify the algorithm to get the actual paths found
    and not only the flow ?
    - is it suitable to use the highest-level push relabel algorithm even
    for a unit capacity network with about 400 nodes and 2000 Edges ?

    Thanks in advance

  • Next message: tchow_at_lsa.umich.edu: "Re: [OT]: Another claim for P=NP & UOTPS is delta_2^p complete"