Presentation

· Contributors · Organizations · Search Program · My Schedule · Happening Now · Maps

This content is available for: Tech Program Reg Pass, Exhibits Reg Pass. Upgrade Registration

Scalable Algorithms for Analyzing Large Dynamic Networks Using CANDY

DescriptionAs the dynamic network’s topology undergoes temporal alterations, associated graph properties must be updated to ensure their ac- curacy. Addressing this requirement efficiently in large dynamic networks led to the proposal of a generic framework, CANDY (Cyberinfrastructure for Accelerating Innovation in Network Dynamics). This paper expounds on the development of algorithms and subsequent performance improvements facilitated by CANDY.

Authors

Aashish Pandey

University of North Texas

Arindam Khanda

Missouri University of Science and Technology

Sriram Srinivasan

University of Oregon

Sudharshan Srinivasan

University of Oregon

S. M. Shovan

Missouri University of Science and Technology