#13808: Gromov hyperbolicity of graphs
----------------------------------------+-----------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.6
Component: graph theory | Resolution:
Keywords: graph, hyperbolicity | Work issues:
Report Upstream: N/A | Reviewers:
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
----------------------------------------+-----------------------------------
Comment (by ncohen):
> Useless, but since it is very fast (linear) it can be used for all
methods, while goodcores is only for cuts+.
Oh. But what is the difference between this function and the other one,
what is it that `_reduce_biconnected_graph` can do and that the core
decomposition can't ? Is their running time very different for the same
purposes ? Why do you need two functions ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13808#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.
