#5913: implement graph coloring in sage
--------------------------+-------------------------------------------------
Reporter: was | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.0
Component: graph theory | Keywords:
--------------------------+-------------------------------------------------
Sage should have some sort of implementation of code for computing a
vertex coloring with n colors of a graph, assuming the chromatic number is
at most n.
Even a stupid initial greedy algorithm implementation would be a lot
faster than what we have now, which is _nothing_.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5913>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
