Efficient methods for computing the reliability polynomials of graphs and complex networks
- 19 January 2022
- journal article
- research article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (7) , 9741-9781
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- On the roots of strongly connected reliability polynomialsNetworks, 2009
- Newton's method and the Computational Complexity of the Fundamental Theorem of AlgebraElectronic Notes in Theoretical Computer Science, 2008
- The Brown–Colbourn conjecture on zeros of reliability polynomials is falseJournal of Combinatorial Theory, Series B, 2004
- Reliability polynomials and link importance in networksIEEE Transactions on Reliability, 1994
- Roots of the Reliability PolynomialsSIAM Journal on Discrete Mathematics, 1992
- On measures of vulnerability of interconnection networksMicroelectronics Reliability, 1989
- Network reliability and the factoring theoremNetworks, 1983
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973
- Reliable circuits using less reliable relaysJournal of the Franklin Institute, 1956
- Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wirdAnnalen der Physik, 1847