Properties of optimal survivable paths in a graph

DOI10.1016/J.CAMWA.2005.04.011zbMATH Open1080.05087OpenAlexW2045801205MaRDI QIDQ814315FDOQ814315

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

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

zbMATH Keywords

Shortest pathsUndirected graphDiverse routingMulticommodity flowOptical networkRouting optimizationSurvivability

Mathematics Subject Classification ID

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

Cites Work

• Dioïds and semirings: Links to fuzzy sets and other applications
• Title not available (Why is that?)
• On the Computational Complexity of Combinatorial Problems

Cited In (3)

• Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks
• Title not available (Why is that?)
• Title not available (Why is that?)

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)