%0 Journal Article %1 journals/networks/LangeRT17 %A Lange, Thomas %A Reinwardt, Manja %A Tittmann, Peter %D 2017 %J Networks %K dblp %N 4 %P 408-414 %T A recursive formula for the two-edge connected and biconnected reliability of a complete graph. %U http://dblp.uni-trier.de/db/journals/networks/networks69.html#LangeRT17 %V 69

@article{journals/networks/LangeRT17, added-at = {2020-06-30T00:00:00.000+0200}, author = {Lange, Thomas and Reinwardt, Manja and Tittmann, Peter}, biburl = {https://www.bibsonomy.org/bibtex/21c9a6bc36796c7ad74e16365b24c39d1/dblp}, ee = {https://doi.org/10.1002/net.21744}, interhash = {d8c57da2e117db6f5f6b2b3326c4556e}, intrahash = {1c9a6bc36796c7ad74e16365b24c39d1}, journal = {Networks}, keywords = {dblp}, number = 4, pages = {408-414}, timestamp = {2020-07-01T11:49:07.000+0200}, title = {A recursive formula for the two-edge connected and biconnected reliability of a complete graph.}, url = {http://dblp.uni-trier.de/db/journals/networks/networks69.html#LangeRT17}, volume = 69, year = 2017 }