#13380: Suurballe-Tarjan algorithm for pair of disjoint st-paths
-----------------------------------------+----------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-5.6
Component: graph theory | Resolution:
Keywords: graph, disjoint paths | Work issues:
Report Upstream: N/A | Reviewers:
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
-----------------------------------------+----------------------------------
Comment (by ncohen):
Arg... I copied/paste an old version of one paragraph :
* By the way, it is nice to advertise your algorithm but let's write
something clean : you test whether you can solve the problem with your new
input parameter k=2, and if it does not work just run the former
algorithm. Well, if it does not work it means that the graphs is not
2-connected, so you can immediately return a shortest path or say that the
graph is disconnected. You alrady obtained an information that can be put
to good use, it's a waste not to do it. But then it depends on what k is
in the end : the "maximum" number of disjoint paths, or the exact number.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13380#comment:4>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
