Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
A Shared-Memory Algorithm For Updating Single-Source Shortest Paths In Large Weighted Dynamic Networks, Sriram Srinivasan
A Shared-Memory Algorithm For Updating Single-Source Shortest Paths In Large Weighted Dynamic Networks, Sriram Srinivasan
UNO Student Research and Creative Activity Fair
In the last decade growth of social media, increased the interest of network algorithms for analyzing large-scale complex systems. The networks are highly unstructured and exhibit poor locality, which has been a challenge for developing scalable parallel algorithms. The state-of-the-art network algorithms such as Prim's algorithm for Minimum Spanning Tree, Dijkstra's algorithm for Single Source Shortest Path and ISPAN algorithm for detecting strongly connected components are designed and optimized for static networks. The networks which change with time i.e. the dynamic networks such as social networks, the above-mentioned approaches can only be utilized if they are recomputed from scratch each …