#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):
> On some computers, unsigned long int are on 32 bits. When you count the
number of visited 4-tuples, you can exceed {{{2^32-1}}}. It happens when
working on biconnected graphs with more than 20000 vertices (kind of
graphs I'm currently considering).
Oh, right. `n^4` can go far beyond 32bits integers indeed !
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13808#comment:12>
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.
