#7529: Maximum Average Degree of a graph
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-4.4.3
Component: graph theory | Keywords:
Author: Nathann Cohen | Upstream: N/A
Reviewer: David Joyner | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Changes (by newvalueoldvalue):
* reviewer: => David Joyner
* author: => Nathann Cohen
Old description:
> The maximum average degree of a graph is the maximum, over all subgraphs
> H of a graph G, of average_degree(H).
>
> This can be computed in polynomial time ( though I do not know of any
> practical way to do it ) and could be used, for example, as a certificate
> for negative answers in #7528.
>
> Nathann
New description:
The maximum average degree of a graph is the maximum, over all subgraphs H
of a graph G, of average_degree(H).
This can be computed in polynomial time ( though I do not know of any
practical way to do it ) and could be used, for example, as a certificate
for negative answers in #7528.
'''Apply:'''
1. #8364
1. #8166
1. #2203
1.
[http://trac.sagemath.org/sage_trac/attachment/ticket/7529/trac_7529.patch
trac_7529.patch]
Even applying in this order, you might get some fuzz. But that's OK and is
not as bad as a hunk failure.
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7529#comment:5>
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.
