#14502: Improvements of hyperbolicity procedures
---------------------------------+------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.10
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by ncohen):
> Does it make more sense?
No, I still don't get it. When you remove simplicial vertices and compute
the hyperbolicity on what is left you make an error of at most 1. Now, if
you do not compute the hyperbolicity of what is left but if you just want
an approximation of the hyperbolicity on what is left then you will
compute this approximate hyperbolicity FASTER (because you do not have to
go through all pairs), and you will get a lower bound `hyp` and an upper
bound `ub`. Hence, because you first removed simplicial vertices, what you
can say for sure is that the hyperbolicity of your graph is between `hyp`
andd `ub+1`.
With what you do, it looks like you force the computation of the exact
hyperbolicity on the reduced graph, which can take a lot of time. And
isn't what the user wanted.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14502#comment:9>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
