#7529: Maximum Average Degree of a graph
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-4.4.2
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Comment(by ncohen):
Thaaaaaaank you so much !!! The other LP tickets are just applications of
the following thing : if a graph has maximum average degree strictly less
than 2 ( so 2-epsilon in the code, or 1-epsilon as it is sometimes
divided) then it is acyclic -> a forest !!
So this ticket really is they key to all others ! When I found how to
solve this one I knew how to write the others, so there shouldn't be any
surprise in them :-)
Thank you again !!
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7529#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.
