首页   按字顺浏览 期刊浏览 卷期浏览 The maximal flow through a directed graph with random capacities
The maximal flow through a directed graph with random capacities

 

作者: G. R. Grimmett,   W-C. S. Suen,  

 

期刊: Stochastics  （Taylor Available online 1982）
卷期: Volume 8, issue 2  

页码: 153-159

 

ISSN:0090-9491

 

年代: 1982

 

DOI:10.1080/17442508208833234

 

出版商: Gordon and Breach Science Publishers Inc,

 

数据来源: Taylor

 

摘要:

We consider the maximal flow through a randomly capacitated network. We show that the maximal flowFnbetween vertices 0 and ∞ on of the complete graph on {0.1.2.…,n –1∞}. whose edges (i.j) are directed from i to j if and only ifi<j, satisfiesnlFn→>E(B) almost surelv and in mean, asn→>∞: hereE(B) is the mean value of a typical edge capacity. This answers a question posed by Grimmett and Welsh [I].

 

点击下载:  PDF (345KB)



返 回