Affiliation:
1. Department of Electrical and Computer Engineering, Babol Noshirvani University of Technology, Mazandaran, Babol, Iran
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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics