Fast parallel algorithm for diameter of undirected unweighted real-world graphs - #97
Open
Rajendraprasad7 wants to merge 1 commit into
Open
Rajendraprasad7 wants to merge 1 commit into
Rajendraprasad7 wants to merge 1 commit into
Conversation
Rajendraprasad7
changed the title
4 tasks
This branch has not been deployed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR implements an embarrassingly parallel algorithm for calculating the diameter of real-world graphs using the Iterative Fringe Upper Bound (
iFub4S) algorithm. (Ref issue#82 )Reference
On computing the diameter of real-world undirected graphs
DOI: 10.1016/j.tcs.2012.09.018
The
iFub4Salgorithm first selects an approximate "central" node using the4-sweepheuristic. The4-sweepmethod starts from a random node, finds its farthest node, then repeats this process four times to approximate a central node. A BFS tree is then rooted at this node, and eccentricities are computed layer-wise in parallel. If the max eccentricity from a layer exceeds twice the layer index, the algorithm terminates and returns the diameter; otherwise, it proceeds further to the next layer.iFub4Sis observed to compute diameters efficiently for real-world graphs.Refer this PR for earlier discussion on this algorithm.