Abstract
We first characterize the minimal link-sets L whose directions must be reversed for reestablishing one or more directed paths from each node x to a fixed destination node d in a network when a link fails. Then, we give a distributed O(|E|) algorithm for determining such a link-set L, where |E| = #(links in the network). This improves the previous lower bound O(n 2), where n = #(nodes in the network). The minimality of the reversed link-set L has other important consequences. © 2009 Springer.
Cite
CITATION STYLE
Kundu, S. (2009). A distributed O(|E|) algorithm for optimal link-reversal. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5408 LNCS, pp. 243–250). https://doi.org/10.1007/978-3-540-92295-7_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
