Advanced search
Publication Cover
Journal of the Chinese Institute of Engineers Volume 18, 1995 - Issue 4
Submit an article Journal homepage
7
Views
0
CrossRef citations to date
0
Altmetric
Papers

An optimal algorithm for finding the most vital edge with respect to SKT reliability in BSP digraphs

Peng‐Fei Wang Institute of Industrial Engineering, National Tsing Hua University, Hsinchu, Taiwan 300, R.O.C.
,
Shaw‐Ching Leu Department of Information Science, National Chao Tung University, Hsinchu, Taiwan 300, R.O.C.
&
Lih‐Hsing Hsu Department of Information Science, National Chao Tung University, Hsinchu, Taiwan 300, R.O.C.
Pages 519-529 | Received 15 Jun 1994, Accepted 04 Oct 1994, Published online: 04 May 2011

References

  • Agrawal , A. and Satyanarayana , A. 1985 . “Network Reliability Analysis Using 2‐Connected Digraph Reductions,” . Networks, , 15 : 239 – 256 .
  • Ball , M.O. 1980 . “Complexity of Network Reliability Computations,” . Networks, , 10 : 153 – 165 .
  • Ball , M.O. , Golden , B.L. and Vohra , R.V. 1989 . “Finding the Most Vital Arcs in a Network,” . Operations Research Letters, , 8 : 73 – 76 .
  • Bondy , J.A. and Murty , U.S.R. 1976 . Graph Theory with Applications, , London : Macmillan .
  • Colbourn , C.J. 1987 . The Combinatorics of Network Reliability, , New York : Oxford University Press .
  • Corley , H.W. and Sha , D.Y . 1982 . “Most Vital Links and Nodes in Weighted Networks,” . Operations Research Letters, , 1 : 157 – 160 .
  • Deo , N. 1974 . Graph Theory with Applications to Engineering Computer Science, , Englewood Cliffs, N.J. : Prentice‐Hall .
  • Duffin , R.J. 1965 . “Topology of Series‐Parallel Networks,” . Journal of Mathematical Analysis & Application, , 10 : 303 – 318 .
  • Hsu , L.H. , Jan , R.H. , Lee , Y.C. , Hung , C.N. and Chern , M.S. 1991 . “Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs,” . Information Processing Letters, , 39 : 277 – 281 .
  • Hung , C.N. , Hsu , L.H. and Sung , T.Y. 1993 . “The Most Vital Edges of Matchings in a Bipartite Graph,” . Networks, , 23 : 309 – 313 .
  • Jan , R.H. , Hsu , L.H. and Lee , Y.Y. 1992 . “The Most Vital Edge with Respect to the Number of Spanning Trees in Two‐Terminal Series‐Parallel Graphs,” . BIT, , 32 : 403 – 412 .
  • Rosenthal , A. 1981 . “Series and Parallel Reductions for Complex Measures of Network Reliability,” . Networks, , 11 : 323 – 334 .
  • Valdes , J. , Tarjan , R.E. and Lawler , E.L. 1982 . “The Recognition of Series Parallel Digraphs,” . SIAM Journal on Computing, , 11 : 297 – 313 .
  • Valiant , L.G. 1979 . “The Complexity of Enumeration and Reliability Problems,” . SIAM Journal on Computing, , 8 : 410 – 421 .
  • Wang , P.F. “Finding the Most Vital Edge with Respect to Minimum Spanning Tree on Pyramid Computer,” . Huafan Annual Journal, , to accept
  • Wang , P.F. and Hsu , L.H. 1993 . “Finding the Most Vital Edge with Respect to K‐Terminal Reliability in Series‐Parallel Networks,” . Computers & Industrial Engineering, , 25 : 457 – 460 .
  • Wang , P.F. , Hsu , L.H. and Wu , C.T. “The Most Vital Edge with Respect to K‐Terminal Reliability in Electronic Networks,” . Proceedings of Chinese Institute of Industrial Engineers National Conference, . pp. 207 – 211 .
  • Wang , P.F. , Leu , S.C. and Hsu , L.H. “Finding the Most Vital Edge with Respect to SKT Reliability in BSP Digraphs,” . Proceedings of National Computer Symposium, . pp. 113 – 120 .
  • Correspondence addressee

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.