Abstract
Network diameter is one of the important parameters of a network, until now, however, there has not been a perfect algorithm which has a lower time complexity than O(n2) to deal with this problem. As increasingly expanding of network scale and increasing number of nodes and edges, it would spend a lot of time that using Floyd algorithm whose time complexity is defined O(n3) or Breadth-first Search(BFS) algorithm whose time complexity is defined O(nm) to compute network diameter. Moreover, BFS is only effective in non-weighted graph. For decreasing the time complexity of computing network diameter, this paper proposes a novel algorithm, Compressing Graph(CG), which bases on the correlative knowledge of graph compression. Through the analysis of time complexity, it shows our algorithm is a feasible method applied for diverse topology graphs and its range of time complexity is O(n) to O(n3).
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.
