Abstract
In this paper we introduce the notion of best swap for a failing edge of a single source shortest paths tree (SPT) S(r) rooted in r in a weighted graph G = (V,E). Given an edge e ∈ S(r), an edge \( e' \in E\backslash \left\{ e \right\} \) is a swap edge if the swap tree \( S_{e\backslash e'} \left( r \right) \) obtained by swapping e with e′ in S(r) is a spanning tree of G. A best swap edge for a given edge e is a swap edge minimizing some distance functional between r and the set of nodes disconnected from the root after the edge e is removed. A swap algorithm with respect to some distance functional computes a best swap edge for every edge in S(r). We show that there exist fast swap algorithms (much faster than recomputing from scratch a new SPT) which also preserve the functionality of the affected SPT.
This research was partially supported by the CHOROCHRONOS TMR Program of the European Community. The work of the third author was partially supported by grant “Combinatorics and Geometry” of the Swiss National Science Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R.K. Ahuia, T.L. Magnanti and J.B Orlin. Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ (1993).
A. Bar-Noy, S. Khuller and B. Schieber, The complexity of finding most vital arcs and nodes, CS-TR-3539, Dept. of Computer Science, Univ. of Maryland, 1995.
D. Frigioni, A. Marchetti-Spaccamela and U. Nanni, Fully dynamic output bounded single source shortest path problem, in Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA'96), 1996, 212–221.
M. Grötschel, C.L. Monma and M. Stoer, Design of survivable networks, in: Handbooks in OR and MS, Vol. 7, Elsevier (1995) 617–672.
D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13(2) (1984) 338–355.
G.F. Italiano and R. Ramaswami, Maintaining spanning trees of small diameter, Proc. 21st Int. Coll. on Automata, Languages and Programming (ICALP'94), 1994, Lecture Notes in Computer Science, Vol. 820, 212–223.
E. Nardelli, G. Proietti and P. Widmayer, Finding all the best swaps of a minimum diameter spanning tree under transient edge failures, Proc. 6th European Symp. on Algorithms (ESA'98), 1998, Lecture Notes in Computer Science, Vol. 1461, 55–66.
R.E. Tarjan, Efficiency of a good but not linear set union algorithm, Journal of the ACM, 22 (1975) 215–225.
R.E. Tarjan, Applications of path compression on balanced trees, Journal of the ACM, 26 (1979) 690–715.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nardelli, E., Proietti, G., Widmayer, P. (1999). How to Swap a Failing Edge of a Single Source Shortest Paths Tree. In: Asano, T., Imai, H., Lee, D.T., Nakano, Si., Tokuyama, T. (eds) Computing and Combinatorics. COCOON 1999. Lecture Notes in Computer Science, vol 1627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48686-0_14
Download citation
DOI: https://doi.org/10.1007/3-540-48686-0_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66200-6
Online ISBN: 978-3-540-48686-2
eBook Packages: Springer Book Archive