Failure disjoint paths

MaRDI QIDQ2861540zbMATH OpenFDO

Authors Walid Ben-Ameur, Michał Pióro, Mateusz Żotkiewicz

Publication date 8 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065310001411

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Paths and cycles (05C38)

Recommendations

• Fractional routing using pairs of failure-disjoint paths
• A quick method for finding shortest pairs of disjoint paths
• Finding disjoint paths with different path-costs: Complexity and algorithms
• scientific article; zbMATH DE number 3922000
• An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs

Cites work

• scientific article; zbMATH DE number 2150800 (Why is no real title available?)
• A note on two problems in connexion with graphs
• A quick method for finding shortest pairs of disjoint paths
• Disjoint paths in a network
• Network flows. Theory, algorithms, and applications.

Cited in

(2)

• On the hop-constrained survivable network design problem with reliable edges
• Minimal functional routes in directed graphs with dependent edges

This page was built for publication: Failure disjoint paths

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