#13808: Gromov hyperbolicity of graphs
----------------------------------------+-----------------------------------
       Reporter:  dcoudert              |         Owner:  jason, ncohen, rlm
           Type:  enhancement           |        Status:  needs_review      
       Priority:  major                 |     Milestone:  sage-5.6          
      Component:  graph theory          |    Resolution:                    
       Keywords:  graph, hyperbolicity  |   Work issues:                    
Report Upstream:  N/A                   |     Reviewers:  Nathann Cohen     
        Authors:  David Coudert         |     Merged in:                    
   Dependencies:                        |      Stopgaps:                    
----------------------------------------+-----------------------------------

Old description:

> This patch implements algorithms for computing the Gromov hyperbolicity
> of a graph. Although the worst case time complexity is in `O(n^4)`, the
> proposed implementation performs quite well in practice. It has been used
> on graphs with more than 10.000 vertices.
>

> APPLY:
> * [attachment:trac_13808-v3.patch]

New description:

 This patch implements algorithms for computing the Gromov hyperbolicity of
 a graph. Although the worst case time complexity is in `O(n^4)`, the
 proposed implementation performs quite well in practice. It has been used
 on graphs with more than 10.000 vertices.


 APPLY:
 * [attachment:trac_13808-v3.patch]
 * [attachment:trac_13808-rev.patch]
 * [attachment:trac_13808-rev2.patch]

--

Comment (by dcoudert):

 Thanks for the revision patch. I did some more improvements in the rev2
 patch to prevent others bugs. In particular, I found that the
 {{{c_distances_all_pairs}}} function returns NULL when the memory space is
 too small. I have added dedicated test, but may be we should patch the
 distance all pairs function.

 Q: should we add a message to MemoryError like "Not enough memory to
 execute the function.". We cannot doctest this because this is machine
 dependent.

 Let me know.

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13808#comment:17>
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.

Reply via email to