首页   按字顺浏览 期刊浏览 卷期浏览 An Algorithm for Vertex-pair Connectivity†
An Algorithm for Vertex-pair Connectivity†

 

作者: I. T. FRISCH,  

 

期刊: International Journal of Control  （Taylor Available online 1967）
卷期: Volume 6, issue 6  

页码: 579-593

 

ISSN:0020-7179

 

年代: 1967

 

DOI:10.1080/00207176708921826

 

出版商: Taylor & Francis Group

 

数据来源: Taylor

 

摘要:

An algorithm is developed for finding the minimum number of vertices ωs,twhose removal from a directed graphGbreaks all directed paths from a given vertexsto a given vertext. The algorithm is performed onGwithout any modification of its structure and entails examining each vertex at mostrtimes with 2ωs,t ≥ rand, in practice, almost always with ωs,t ≥ r.

 

点击下载:  PDF (258KB)



返 回