Narain, Rakesh1: Aryabhatt College of Engineering and Technology, Baghpat 250 601, Uttar Pradesh, Indi; 2: Mechanical Engineering Department, Motilal Nehru National Institute of Technology, Allahabad 211 004, U
So, we consider the computation of swap edges in an arbitrary spanning tree, where swap edges are selected to minimize the time required to recover routing in case of a failure, and produce efficient distributed algorithms for two variants.Rakesh Kumar YadavKumar AbhishekKerana Hanerix...