"A recursive formula for the two-edge connected and biconnected reliability ..."

Thomas Lange, Manja Reinwardt, Peter Tittmann (2017)

> Home

Details and statistics

DOI: 10.1002/NET.21744

access: closed

type: Journal Article

metadata version: 2020-06-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/LangeRT17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/LangeRT17
Thomas Lange, Manja Reinwardt, Peter Tittmann:
A recursive formula for the two-edge connected and biconnected reliability of a complete graph. Networks 69(4): 408-414 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.