Properties of optimal survivable paths in a graph

DOI10.1016/J.CAMWA.2005.04.011MaRDI QIDQ814315zbMATHOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 6260127
• Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks
• scientific article; zbMATH DE number 795223
• The optimal rescue path set problem in undirected graphs
• On survivable network polyhedra

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• Dioïds and semirings: Links to fuzzy sets and other applications
• On the Computational Complexity of Combinatorial Problems

Cited in

(3)

• scientific article; zbMATH DE number 1517141 (Why is no real title available?)
• Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks
• scientific article; zbMATH DE number 6260127 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814315)