{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T02:20:07Z","timestamp":1768011607142,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T00:00:00Z","timestamp":1642550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T00:00:00Z","timestamp":1642550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11227-021-04216-2","type":"journal-article","created":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T00:03:11Z","timestamp":1642550591000},"page":"9741-9781","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient methods for computing the reliability polynomials of graphs and complex networks"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8546-3148","authenticated-orcid":false,"given":"F.","family":"Safaei","sequence":"first","affiliation":[]},{"given":"R.","family":"Akbar","sequence":"additional","affiliation":[]},{"given":"M.","family":"Moudi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,19]]},"reference":[{"key":"4216_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2021.08.058","author":"D Di Caprio","year":"2021","unstructured":"Di Caprio D et al (2021) A novel ant colony algorithm for solving shortest path problems with fuzzy arc weights. Alex Eng J. https:\/\/doi.org\/10.1016\/j.aej.2021.08.058","journal-title":"Alex Eng J"},{"issue":"2","key":"4216_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1142\/S0218488521500116","volume":"29","author":"AA Sori","year":"2021","unstructured":"Sori AA et al (2021) Fuzzy constrained shortest path problem for location-based online services. Int J Uncertain Fuzz Knowl-Based Syst 29(2):231\u2013248","journal-title":"Int J Uncertain Fuzz Knowl-Based Syst"},{"issue":"2","key":"4216_CR3","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1111\/coin.12258","volume":"36","author":"AA Sori","year":"2020","unstructured":"Sori AA et al (2020) Elite artificial bees\u2019 colony algorithm to solve robot\u2019s fuzzy constrained routing problem. Comput Intell 36(2):659\u2013681","journal-title":"Comput Intell"},{"issue":"4","key":"4216_CR4","doi-asserted-by":"publisher","first-page":"4711","DOI":"10.3233\/JIFS-191413","volume":"38","author":"AA Sori","year":"2020","unstructured":"Sori AA et al (2020) The fuzzy inference approach to solve multi-objective constrained shortest path problem. J Intell Fuzzy Syst 38(4):4711\u20134720","journal-title":"J Intell Fuzzy Syst"},{"key":"4216_CR5","unstructured":"Y. Khorramzadeh, (2015) Network reliability: theory, estimation, and applications, Ph.D. dissertation, Virginia Tech"},{"issue":"3","key":"4216_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","volume":"262","author":"EF Moore","year":"1956","unstructured":"Moore EF, Shannon CE (1956) Reliable circuits using less reliable relays. J Franklin Inst 262(3):191\u2013208","journal-title":"J Franklin Inst"},{"key":"4216_CR7","doi-asserted-by":"publisher","first-page":"25411","DOI":"10.1109\/ACCESS.2018.2828036","volume":"6","author":"ER Cowell","year":"2018","unstructured":"Cowell ER et al (2018) On the exact reliability enhancements of small hammock networks. IEEE Access 6:25411\u201325426","journal-title":"IEEE Access"},{"key":"4216_CR8","doi-asserted-by":"crossref","unstructured":"Rohatinovici NC, Pro\u015ftean O, Balas VE (2018) On reliability of 3D hammock networks. In: IEEE 12th International Symposium on Applied Computational Intelligence and Informatics (SACI), pp 000149\u2013000154","DOI":"10.1109\/SACI.2018.8441003"},{"key":"4216_CR9","doi-asserted-by":"crossref","unstructured":"Robledo F et al (2013) A novel interpolation technique to address the Edge-Reliability problem. In: 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), IEEE, pp 187\u2013192","DOI":"10.1109\/ICUMT.2013.6798425"},{"key":"4216_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.dam.2015.06.006","volume":"198","author":"JM Burgos","year":"2016","unstructured":"Burgos JM, Amoza FR (2016) Factorization of network reliability with perfect nodes I: introduction and statements. Discret Appl Math 198:82\u201390","journal-title":"Discret Appl Math"},{"issue":"4","key":"4216_CR11","doi-asserted-by":"publisher","first-page":"042814","DOI":"10.1103\/PhysRevE.91.042814","volume":"91","author":"Y Khorramzadeh","year":"2015","unstructured":"Khorramzadeh Y et al (2015) Analyzing network reliability using structural motifs. Phys Rev E 91(4):042814","journal-title":"Phys Rev E"},{"issue":"4","key":"4216_CR12","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1093\/comnet\/cnu037","volume":"2","author":"S Eubank","year":"2014","unstructured":"Eubank S, Youssef M, Khorramzadeh Y (2014) Using the network reliability polynomial to characterize and design networks. J Complex Netw 2(4):356\u2013372","journal-title":"J Complex Netw"},{"key":"4216_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.dam.2014.05.048","volume":"177","author":"JI Brown","year":"2014","unstructured":"Brown JI, Cox D, Ehrenborg R (2014) The average reliability of a graph. Discret Appl Math 177:19\u201333","journal-title":"Discret Appl Math"},{"key":"4216_CR14","doi-asserted-by":"crossref","unstructured":"J.I. Brown and K. Dilcher, On the roots of strongly connected reliability polynomials, Networks: An International Journal, Vol. 54, No. 2, pp.108\u2013116, 2009.","DOI":"10.1002\/net.20301"},{"issue":"4","key":"4216_CR15","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/0405047","volume":"5","author":"JI Brown","year":"1992","unstructured":"Brown JI, Colbourn CJ (1992) Roots of the reliability polynomials. SIAM J Discret Math 5(4):571\u2013585","journal-title":"SIAM J Discret Math"},{"issue":"2","key":"4216_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.jctb.2004.03.008","volume":"91","author":"G Royle","year":"2004","unstructured":"Royle G, Sokal AD (2004) The Brown-Colbourn conjecture on zeros of reliability polynomials is false. J Comb Theory Ser B 91(2):345\u2013360","journal-title":"J Comb Theory Ser B"},{"issue":"1","key":"4216_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s11235-013-9820-0","volume":"56","author":"JI Brown","year":"2014","unstructured":"Brown JI et al (2014) Inflection points for network reliability. Telecommun Syst 56(1):79\u201384","journal-title":"Telecommun Syst"},{"key":"4216_CR18","unstructured":"Brown JI, Ko\u00e7 Y, Kooij RE (2011) Reliability polynomials crossing more than twice. In: 3rd IEEE International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp 1\u20136"},{"issue":"1","key":"4216_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/24.285108","volume":"43","author":"LB Page","year":"1994","unstructured":"Page LB, Perry JE (1994) Reliability polynomials and link importance in networks. IEEE Trans Reliab 43(1):51\u201358","journal-title":"IEEE Trans Reliab"},{"key":"4216_CR20","doi-asserted-by":"crossref","unstructured":"Chen Y et al (2003) A note on reliability polynomials and link importance in networks. In: International Conference on Neural Networks and Signal Processing, Proceedings of the 2003, vol 2, pp 1674\u20131676, IEEE","DOI":"10.1109\/ICNNSP.2003.1281205"},{"key":"4216_CR21","first-page":"143","volume":"197","author":"I Beichl","year":"2010","unstructured":"Beichl I, Cloteaux B, Sullivan F (2010) An approximation algorithm for the coefficients of the reliability polynomial. Congr Numer 197:143\u2013151","journal-title":"Congr Numer"},{"key":"4216_CR22","first-page":"217","volume":"62","author":"CJ Colbourn","year":"1988","unstructured":"Colbourn CJ, Debroni BM, Myrvold WJ (1988) Estimating the coefficients of the reliability polynomial. Congr Numer 62:217\u2013223","journal-title":"Congr Numer"},{"key":"4216_CR23","unstructured":"Harris DG, Sullivan F (2015) Sequential importance sampling algorithms for estimating the all-terminal reliability polynomial of sparse graphs. In: Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques (APPROX\/RANDOM 2015), Schloss Dagstuhl-Leibniz-Zentrum Fuer Informatik"},{"key":"4216_CR24","doi-asserted-by":"crossref","unstructured":"Harris DG, Sullivan F, Beichl I (2011) Linear algebra and sequential importance sampling for network reliability. In: IEEE Proceedings of the 2011 Winter Simulation Conference (WSC), pp 3339\u20133347","DOI":"10.1109\/WSC.2011.6148030"},{"key":"4216_CR25","volume-title":"System reliability theory: models, statistical methods, and applications","author":"M Rausand","year":"2003","unstructured":"Rausand M, Hoyland A (2003) System reliability theory: models, statistical methods, and applications. Wiley, London"},{"key":"4216_CR26","volume-title":"The combinatorics of network reliability","author":"CJ Colbourn","year":"1987","unstructured":"Colbourn CJ (1987) The combinatorics of network reliability. Oxford University Press, New York"},{"key":"4216_CR27","unstructured":"W. Ellens, (2011) Effective resistance and other graph measures for network robustness, MS thesis, Leiden University"},{"key":"4216_CR28","doi-asserted-by":"crossref","unstructured":"G. Kirchhoff, (1847) \u00dcber die Aufl\u00f6sung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Str\u00f6me gef\u00fchrt wird. Ann Phys, 148: 497\u2013508","DOI":"10.1002\/andp.18471481202"},{"issue":"1","key":"4216_CR29","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1002\/net.3230130107","volume":"13","author":"A Satyanarayana","year":"1983","unstructured":"Satyanarayana A, Chang MK (1983) Network reliability and the factoring theorem. Networks 13(1):107\u2013120","journal-title":"Networks"},{"key":"4216_CR30","first-page":"551","volume":"78","author":"F Benford","year":"1938","unstructured":"Benford F (1938) The law of anomalous numbers. Proc Am Philos Soc 78:551\u2013572","journal-title":"Proc Am Philos Soc"},{"key":"4216_CR31","unstructured":"L. Zhipeng, C. Lin, W. Huajia, (2004) Discussion on Benford\u2019s law and its applications, Cornell University Library"},{"issue":"4","key":"4216_CR32","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1214\/ss\/1177009869","volume":"10","author":"TP Hill","year":"1995","unstructured":"Hill TP (1995) A statistical derivation of the significant-digit law. Stat Sci 10(4):354\u2013363","journal-title":"Stat Sci"},{"key":"4216_CR33","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.entcs.2008.03.016","volume":"202","author":"P Batra","year":"2008","unstructured":"Batra P (2008) Newton\u2019s method and the computational complexity of the fundamental theorem of algebra. Electron Notes Theor Comput Sci 202:201\u2013218","journal-title":"Electron Notes Theor Comput Sci"},{"issue":"6","key":"4216_CR34","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/0026-2714(89)90026-7","volume":"29","author":"M Choi","year":"1989","unstructured":"Choi M, Krishna CM (1989) On measures of vulnerability of interconnection networks. Microelectron Reliab 29(6):1011\u20131020","journal-title":"Microelectron Reliab"},{"issue":"3","key":"4216_CR35","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V (1973) Tough graphs and Hamiltonian circuits. Discret Math 5(3):215\u2013228","journal-title":"Discret Math"},{"issue":"98","key":"4216_CR36","doi-asserted-by":"publisher","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler M (1973) Algebraic connectivity of graphs. Czechoslov Math J 23(98):298\u2013305","journal-title":"Czechoslov Math J"},{"key":"4216_CR37","doi-asserted-by":"crossref","unstructured":"Baras JS, Hovareshti P (2009) Efficient and robust communication topologies for distributed decision making in networked systems. In: Proceedings of the 48th IEEE Conference on Decision and Control (CDC), pp 3751\u20133756","DOI":"10.1109\/CDC.2009.5400448"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04216-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-04216-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04216-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T15:12:52Z","timestamp":1726499572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-04216-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,19]]},"references-count":37,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["4216"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-04216-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,19]]},"assertion":[{"value":"16 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}