Properties of optimal survivable paths in a graph

DOI10.1016/J.CAMWA.2005.04.011zbMath1080.05087OpenAlexW2045801205MaRDI QIDQ814315

N. E. Zubov

Publication date: 6 February 2006

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.04.011

zbMATH Keywords

Shortest pathsUndirected graphDiverse routingMulticommodity flowOptical networkRouting optimizationSurvivability

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

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

Cites Work

• Unnamed Item
• Dioïds and semirings: Links to fuzzy sets and other applications
• On the Computational Complexity of Combinatorial Problems

This page was built for publication: Properties of optimal survivable paths in a graph