Abstract
We introduce the concept of a survivable path in an undirected graph G. A survivable path between a pair of vertices in G is a pair of edge-disjoint paths consisting of a working path and a redundant protection path. Protection paths share edges in such a manner as to provide guaranteed recovery upon the failure of any single edge. Survivable paths play an important role in the design of survivable communication networks. We demonstrate several results on the properties of the optimal set of survivable paths.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.