Cite
MLA Citation
Thomas Lange et al.. “A recursive formula for the two‐edge connected and biconnected reliability of a complete graph.” Networks, vol. 69, no. 4, 2017, pp. 408–414. http://access.bl.uk/ark:/81055/vdc_100046697577.0x000062
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Thomas Lange et al.. “A recursive formula for the two‐edge connected and biconnected reliability of a complete graph.” Networks, vol. 69, no. 4, 2017, pp. 408–414. http://access.bl.uk/ark:/81055/vdc_100046697577.0x000062