Author:
Bourel Mathias,Canale Eduardo,Robledo Franco,Romero Pablo,Stábile Luis
Publisher
Springer International Publishing
Reference23 articles.
1. Bauer, D., Boesch, F., Suffel, C., Van Slyke, R.: On the validity of a reduction of reliable network design to a graph extremal problem. IEEE Trans. Circuits Syst. 34(12), 1579–1581 (1987)
2. Encyclopedia of Mathematics and its Applications;LW Beineke,2012
3. Cambridge Mathematical Library;N Biggs,1993
4. Boesch, F.T., Li, X., Suffel, C.: On the existence of uniformly optimally reliable networks. Networks 21(2), 181–194 (1991)
5. Canale, E., Cancela, H., Robledo, F., Romero, P., Sartor, P.: Full complexity analysis of the diameter-constrained reliability. Int. Trans. Oper. Res. 22(5), 811–821 (2015)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Network reliability in hamiltonian graphs;Discrete Optimization;2021-08
2. Design of Most-Reliable Cubic Networks by Augmentations;2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020;2020-03
3. Uniformly Most-Reliable Graphs and Antiholes;Machine Learning, Optimization, and Data Science;2019