✦ LIBER ✦

Problem of computing the expected maximum number of vertex-disjoint s-t paths on probabilistic digraphs

✍ Scribed by Peng Cheng; Shigeru Masuyama

Book ID: 112079761
Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 686 KB
Volume: 78
Category: Article
ISSN: 1042-0967
DOI: 10.1002/ecjc.4430780102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the equivalence in complexity among t

On the equivalence in complexity among three computation problems on maximum number of edge-disjoint s−t paths in a probabilistic graph

✍ Pen Cheng; Shigeru Masuyama 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 396 KB

On fluctuation analysis: a new, simple a

On fluctuation analysis: a new, simple and efficient method for computing the expected number of mutants

✍ S. Sarkar; W. T. Ma; G. v. H. Sandri 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 448 KB

Fluctuation analysis, which is often used to demonstrate random mutagenesis in cell lines (and to estimate mutation rates), is based on the properties of a probability distribution known as the Luria-Delbrück distribution (and its generalizations). The two main new results reported in this paper are