Opened 8 years ago

Last modified 8 years ago

#13808 closed enhancement

Gromov hyperbolicity of graphs — at Initial Version

Reported by: dcoudert Owned by: jason, ncohen, rlm
Priority: major Milestone: sage-5.6
Component: graph theory Keywords: graph, hyperbolicity
Cc: ncohen Merged in:
Authors: David Coudert Reviewers:
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: Stopgaps:

Status badges


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.

Change History (0)

Note: See TracTickets for help on using tickets.