#16471: The Push-Relabel method for Maximum Flow
----------------------------+---------------------------------------------
Reporter: foosterhof | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.3
Component: graph theory | Keywords: maximum flow push relabel
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies: #16467, #16470
Stopgaps: |
----------------------------+---------------------------------------------
The Push-Relabel method is a method to compute the Maximum Flow in a
graph. Research has shown that it is both asymptotically and practically
faster than several other methods, including Ford-Fulkerson, and its much
used implementation, Edmonds-Karp.
I have been busy with implementing this method for Sage and will be
uploading it shortly to this ticket. With it, I will explain some design
decisions that I made and provide the (in my opinion) extensive testcases
I ran, and later some profiling results (after all tests have ran again,
since I lost my profiling info of earlier runs).
--
Ticket URL: <http://trac.sagemath.org/ticket/16471>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
