#7358: Strong orientations of 2-connected graphs
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.2.1
Component: graph theory | Keywords:
Work_issues: | Author:
Reviewer: | Merged:
----------------------------+-----------------------------------------------
A special case of #7303 ( which is much easier and efficient to implement
) is to find a strongly connected orientation of the edges of a bridgeless
connected graph.
This can be done using the short algorithm given in :
Schriver Combinatorial optimization
Volume B
page 1037
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7358>
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
-~----------~----~----~----~------~----~------~--~---
