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

DOI10.15807/jorsj.37.96zbMath0817.90025OpenAlexW1527020199MaRDI QIDQ4320147

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)

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