A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS

DOI10.15807/JORSJ.37.96MaRDI QIDQ4320147zbMATH OpenOpenAlexFDO

Authors Peng Cheng, Shigeru Masuyama

Publication date 1 August 1995

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.37.96

zbMATH Keywords

NP-hardprobabilistic graphtwo-terminal graphlower obund

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Recommendations

• A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs
• scientific article; zbMATH DE number 1003293
• Maximum flows in probabilistic networks
• scientific article; zbMATH DE number 871922
• Shortest path problems with node failures

Cited in

(2)

• Estimating the Number of s-t Paths in a Graph
• A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs

This page was built for publication: A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS

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