Abstract
The fastest known algorithms for finding the exact value of the diameter of general graphs are no faster than the algorithms that compute all-pairs shortest paths. An extension of the problem of computing graph diameter is enumerating pairs of vertices in a graph, ordered decreasingly by their distance. In this paper, we investigate this problem with the presence of memory constraints. We also show how our result can help the computation of graph Hyperbolicity, by lowering the memory complexity of computing the ordered list of far-apart vertex pairs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
