Failure disjoint paths
From MaRDI portal
Publication:2861540
zbMATH Open1274.90332MaRDI QIDQ2861540FDOQ2861540
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
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
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Paths and cycles (05C38)
Cites Work
Cited In (2)
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)