✦ LIBER ✦

Maximum flow in probabilistic graphs-the discrete case

✍ Scribed by J. R. Evans

Publisher: John Wiley and Sons
Year: 1976
Tongue: English
Weight: 912 KB
Volume: 6
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230060208

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Frank and Frisch have considered the problem of determining the maximum flow probability distribution in networks where each branch has capacity that is a continuous random variable. In this paper, we consider the branch capacity distributions to be discrete and investigate some theoretical properties of the problem under this assumption.

📜 SIMILAR VOLUMES

Maximum flows in probabilistic networks

✍ Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 868 KB

Maximum flow in probabilistic communicat

Maximum flow in probabilistic communication networks

✍ S. P. Nawathe; B. V. Rao 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 740 KB

The maximum number of cliques in dense g

The maximum number of cliques in dense graphs

✍ Bruce Hedman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Denote the number of vertices of G by ]G[. A clique of graph G is a maximal complete subgraph. The density oJ(G) is the number of vertices in the largest clique of G. If ¢o(G)>~½ ]GI, then G has at most 2 t°l-'cG) cliques. The extremal graphs are then examined as wen. ## Terminology We will be co

A new—old algorithm for minimum-cut and

A new—old algorithm for minimum-cut and maximum-flow in closure graphs

✍ Dorit S. Hochbaum 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB

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

The Algebra of Flows in Graphs

✍ David G Wagner 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 452 KB

We define a contravariant functor K from the category of finite graphs and graph morphisms to the category of finitely generated graded abelian groups and homomorphisms. For a graph X, an abelian group B, and a nonnegative integer j, Ž j Ž . . an element of Hom K X , B is a coherent family of B-valu