Analyzing the properties of large scale dynamic networks is an important and computationally intensive problem. This challenge further increases when the networks are dynamic , i.e. they change with time. In this talk I will present some of our recent results on updating tree-like structures for dynamic graphs. I will further discuss the challenges arising in obtaining scalability and inmeasuring the correctness of the solutions.