Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks

DOI10.1016/J.ENDM.2005.06.001zbMath1137.90688OpenAlexW1982582305MaRDI QIDQ3439300

Zbigniew R. Bogdanowicz

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.001

zbMATH Keywords

shortest pathsroutingnetwork survivability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Communication theory (94A05)

Cites Work

• Properties of optimal survivable paths in a graph
• On the Computational Complexity of Combinatorial Problems
• Solving the Two-Connected Network with Bounded Meshes Problem

This page was built for publication: Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks