Title of article
Failure disjoint paths
Author/Authors
?otkiewicz، نويسنده , , Mateusz and Ben-Ameur، نويسنده , , W. and Pi?ro، نويسنده , , Micha?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
1105
To page
1112
Abstract
Given a weighted directed graph where some arcs can fail while others are reliable, we aim to compute a shortest pair of failure-disjoint paths. If a reliable arc is used by both paths, its cost is counted only once. We present a polynomial time algorithm to solve the problem.
Keywords
shortest paths , polynomial time algorithms , Disjoint paths
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455582
Link To Document