On variations of the isolation lemma for graphs
碩士 === 元智大學 === 資訊工程學系 === 103 === We modify the isolation lemma to analyze the probability that a strongly connected directed graph with independent and binomially (resp. normally) distributed edge weights has a unique shortest (resp. close-to-shortest) s-t path for all vertices s and t....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/74335322926806505688 |