Cite
HARVARD Citation
Lange, T. et al. (2017). A recursive formula for the two‐edge connected and biconnected reliability of a complete graph. Networks. 69 (4), pp. 408-414. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Lange, T. et al. (2017). A recursive formula for the two‐edge connected and biconnected reliability of a complete graph. Networks. 69 (4), pp. 408-414. [Online].