{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T16:36:48Z","timestamp":1772037408790,"version":"3.50.1"},"reference-count":68,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006595","name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006730","name":"Guvernul Romaniei Ministerul Educatiei","doi-asserted-by":"publisher","award":["PN-III-P4-ID-PCE-2020-2495"],"award-info":[{"award-number":["PN-III-P4-ID-PCE-2020-2495"]}],"id":[{"id":"10.13039\/501100006730","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Reliability Engineering & System Safety"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.ress.2025.112121","type":"journal-article","created":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T23:21:13Z","timestamp":1766272873000},"page":"112121","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Computing the reliability of hammock networks in quadratic time with respect to length"],"prefix":"10.1016","volume":"270","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-2918-0597","authenticated-orcid":false,"given":"Mihail","family":"Jianu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2718-8133","authenticated-orcid":false,"given":"Marilena","family":"Jianu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2770-023X","authenticated-orcid":false,"given":"Leonard","family":"D\u0103u\u015f","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8185-956X","authenticated-orcid":false,"given":"Valeriu","family":"Beiu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ress.2025.112121_bib0001","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","article-title":"Reliable circuits using less reliable relays, part I","volume":"262","author":"Moore","year":"1956","journal-title":"J Frankl Inst"},{"issue":"4","key":"10.1016\/j.ress.2025.112121_bib0002","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0016-0032(56)90044-8","article-title":"Reliable circuits using less reliable relays, part II","volume":"262","author":"Moore","year":"1956","journal-title":"J Frankl Inst"},{"key":"10.1016\/j.ress.2025.112121_bib0003","series-title":"Mathematical theory of reliability","author":"Barlow","year":"1996"},{"key":"10.1016\/j.ress.2025.112121_bib0004","series-title":"The combinatorics of network reliability","author":"Colbourn","year":"1987"},{"key":"10.1016\/j.ress.2025.112121_bib0005","series-title":"Handbooks in Operations Research and Management Science, vol 7 (Network models)","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1016\/S0927-0507(05)80128-8","article-title":"Network reliability","author":"Ball","year":"1995"},{"key":"10.1016\/j.ress.2025.112121_bib0006","series-title":"Handbook of the Tutte polynomial and related topics","article-title":"Network reliability","author":"Brown","year":"2022"},{"issue":"3","key":"10.1016\/j.ress.2025.112121_bib0007","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s11786-018-0345-5","article-title":"Sixty years of network reliability","volume":"12","author":"P\u00e9rez-Ros\u00e9s","year":"2018","journal-title":"Math Comp Sci"},{"issue":"3","key":"10.1016\/j.ress.2025.112121_bib0008","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J Comput"},{"issue":"3","key":"10.1016\/j.ress.2025.112121_bib0009","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/TR.1986.4335422","article-title":"Computational complexity of network reliability analysis: an overview","volume":"35","author":"Ball","year":"1986","journal-title":"IEEE Trans Reliab"},{"issue":"1","key":"10.1016\/j.ress.2025.112121_bib0010","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1002\/net.21977","article-title":"Network reliability: heading out on the highway","volume":"77","author":"Brown","year":"2021","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ress.2025.112121_bib0011","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/net.3230130107","article-title":"Network reliability and the factoring theorem","volume":"13","author":"Satyanarayana","year":"1983","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.ress.2025.112121_bib0012","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1287\/opre.32.3.516","article-title":"Computing reliability polynomial in time polynomial in the number of cuts","volume":"32","author":"Provan","year":"1984","journal-title":"Oper Res"},{"issue":"7","key":"10.1016\/j.ress.2025.112121_bib0013","doi-asserted-by":"crossref","first-page":"2313","DOI":"10.1002\/qre.1937","article-title":"A parallel strategy for the logical-probabilistic calculus-based method to calculate two-terminal reliability","volume":"32","author":"Nguyen","year":"2016","journal-title":"Qual Reliab Eng Int"},{"key":"10.1016\/j.ress.2025.112121_bib0014","series-title":"Tech. Rep.","article-title":"Brick-wall lattice paths and applications","author":"D\u0103u\u015f","year":"2018"},{"key":"10.1016\/j.ress.2025.112121_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2019.106665","article-title":"An efficient algorithm for computing network reliability in small treewidth","volume":"193","author":"Goharshady","year":"2020","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2025.112121_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2021.107448","article-title":"Novel binary-addition tree algorithm (BAT) for binary-state network reliability problem","volume":"208","author":"Yeh","year":"2021","journal-title":"Reliab Eng Syst Saf"},{"issue":"7","key":"10.1016\/j.ress.2025.112121_bib0017","doi-asserted-by":"crossref","first-page":"9741","DOI":"10.1007\/s11227-021-04216-2","article-title":"Efficient methods for computing the reliability polynomials of graphs and complex networks","volume":"78","author":"Safaei","year":"2022","journal-title":"J Supercomp"},{"issue":"24","key":"10.1016\/j.ress.2025.112121_bib0018","doi-asserted-by":"crossref","first-page":"3182","DOI":"10.3390\/math9243182","article-title":"Generalized convexity properties and shape-based approximation in networks reliability","volume":"9","author":"Cristescu","year":"2021","journal-title":"Mathematics"},{"key":"10.1016\/j.ress.2025.112121_bib0019","series-title":"International Conference on Computers, Communications and Control (ICCCC 2022)","first-page":"415","article-title":"Using Delta-Wye transformations for estimating network\u2019s reliability","author":"Jianu","year":"2023"},{"key":"10.1016\/j.ress.2025.112121_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2019.04.025","article-title":"Principled network reliability approximation: a counting-based approach","volume":"191","author":"Paredes","year":"2019","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2025.112121_bib0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2024.109968","article-title":"A novel layer-by-layer recursive decomposition algorithm for calculation of network reliability","volume":"244","author":"Wu","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"issue":"4","key":"10.1016\/j.ress.2025.112121_bib0022","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/net.3230160404","article-title":"Improving reliability bounds in computer networks","volume":"16","author":"Brecht","year":"1986","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.ress.2025.112121_bib0023","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(88)90065-0","article-title":"Lower bounds on two-terminal network reliability","volume":"21","author":"Brecht","year":"1988","journal-title":"Discrete Appl Math"},{"issue":"3","key":"10.1016\/j.ress.2025.112121_bib0024","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1016\/j.ejor.2014.04.035","article-title":"Fast computation of bounds for two-terminal network reliability","volume":"238","author":"Sebastio","year":"2014","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.ress.2025.112121_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2025.110805","article-title":"An efficient method for network connectivity reliability computation considering correlation of components","volume":"257","author":"Lu","year":"2025","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2025.112121_bib0026","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.dam.2017.11.035","article-title":"The shape of node reliability","volume":"238","author":"Brown","year":"2018","journal-title":"Discrete Appl Math"},{"key":"10.1016\/j.ress.2025.112121_bib0027","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.ress.2019.03.026","article-title":"Efficient construction of binary decision diagrams for network reliability with imperfect vertices","volume":"188","author":"Kawahara","year":"2019","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2025.112121_bib0028","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2025.111220","article-title":"A novel d-flow network decomposition algorithm for fast search and efficient storage of all d-MPs","volume":"262","author":"Wu","year":"2025","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2025.112121_bib0029","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2023.109876","article-title":"A new hybrid inequality BAT for comprehensive all-level d-MP identification using minimal paths in multistate flow network reliability analysis","volume":"244","author":"Yeh","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2025.112121_bib0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2025.110916","article-title":"GE-MBAT: an efficient algorithm for reliability assessment in multi-state flow networks","volume":"260","author":"Hao","year":"2025","journal-title":"Reliab Eng Syst Saf"},{"issue":"5","key":"10.1016\/j.ress.2025.112121_bib0031","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1088\/0253-6102\/69\/5\/610","article-title":"Electrical properties of an m\u202f\u00d7\u202fn hammock network","volume":"69","author":"Tan","year":"2018","journal-title":"Commun Theor Phys"},{"key":"10.1016\/j.ress.2025.112121_bib0032","series-title":"International Conference on Computers, Communications and Control (ICCCC 2020)","first-page":"93","article-title":"The shape of the reliability polynomial of a hammock network","author":"D\u0103u\u015f","year":"2021"},{"key":"10.1016\/j.ress.2025.112121_bib0033","doi-asserted-by":"crossref","DOI":"10.1063\/5.0171330","article-title":"Exact novel formulas and fast algorithm of potential for a hammock resistor network","volume":"13","author":"Zhou","year":"2023","journal-title":"AIP Adv"},{"key":"10.1016\/j.ress.2025.112121_bib0034","series-title":"Int Conf Comp Knowledge Eng (ICCKE)","first-page":"150","article-title":"Reliability evaluation of 4:2 compressors based on hammock networks","author":"Safaei","year":"2023"},{"key":"10.1016\/j.ress.2025.112121_bib0035","series-title":"IEEE Intl Conf Rebooting Comp (ICRC)","first-page":"16","article-title":"Why reliability for computing needs rethinking","author":"Beiu","year":"2020"},{"issue":"6","key":"10.1016\/j.ress.2025.112121_bib0036","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1038\/s41567-018-0124-x","article-title":"Characterizing quantum supremacy in near-term devices","volume":"14","author":"Boixo","year":"2018","journal-title":"Nat Phys"},{"issue":"7779","key":"10.1016\/j.ress.2025.112121_bib0037","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","article-title":"Quantum supremacy using a programmable superconducting processor","volume":"574","author":"Arute","year":"2019","journal-title":"Nature"},{"issue":"1","key":"10.1016\/j.ress.2025.112121_bib0038","article-title":"Topological and subsystem codes on low-degree graphs with flag qubits","volume":"10","author":"Chamberland","year":"2020","journal-title":"Phys Rev X"},{"key":"10.1016\/j.ress.2025.112121_bib0039","unstructured":"IBM. The IBM Quantum heavy hex lattice. Technical note, IBM Research. Yorktown Heights, NY; 2021. https:\/\/www.ibm.com\/quantum\/blog\/heavy-hex-lattice."},{"key":"10.1016\/j.ress.2025.112121_bib0040","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevApplied.11.064044","article-title":"Matrix optimization on universal unitary photonic devices","volume":"11","author":"Pai","year":"2019","journal-title":"Phys Rev Appl"},{"key":"10.1016\/j.ress.2025.112121_bib0041","doi-asserted-by":"crossref","DOI":"10.1088\/1361-6633\/aad5b2","article-title":"Photonic quantum information processing: a review","volume":"82","author":"Flamini","year":"2019","journal-title":"Rep Prog Phys"},{"issue":"8052","key":"10.1016\/j.ress.2025.112121_bib0042","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1038\/s41586-024-08406-9","article-title":"Scaling and networking a modular photonic quantum computer","volume":"638","author":"Aghaee Rad","year":"2025","journal-title":"Nature"},{"key":"10.1016\/j.ress.2025.112121_bib0043","doi-asserted-by":"crossref","first-page":"25411","DOI":"10.1109\/ACCESS.2018.2828036","article-title":"On the exact reliability enhancements of small hammock networks","volume":"6","author":"Cowell","year":"2018","journal-title":"IEEE Access"},{"issue":"5","key":"10.1016\/j.ress.2025.112121_bib0044","doi-asserted-by":"crossref","first-page":"772","DOI":"10.15837\/ijccc.2018.5.3354","article-title":"How reliable are compositions of series and parallel networks compared with hammocks?","volume":"13","author":"Dr\u0103goi","year":"2018","journal-title":"Int J Comp Commun Control"},{"issue":"1","key":"10.1016\/j.ress.2025.112121_bib0045","doi-asserted-by":"crossref","first-page":"198","DOI":"10.2298\/AADM190805017D","article-title":"Full Hermite interpolation of the reliability of a hammock network","volume":"14","author":"D\u0103u\u015f","year":"2020","journal-title":"Appl Anal Discr Math"},{"key":"10.1016\/j.ress.2025.112121_bib0046","series-title":"International Conference on Computers, Communications and Control (ICCCC 2020)","first-page":"70","article-title":"Experimenting with beta distributions for approximating hammocks\u2019 reliability","author":"Cowell","year":"2021"},{"issue":"3","key":"10.1016\/j.ress.2025.112121_bib0047","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/TR.2021.3049957","article-title":"Efficient approximation of two-terminal networks reliability polynomials using cubic splines","volume":"70","author":"Cristescu","year":"2021","journal-title":"IEEE Trans Reliab"},{"issue":"2","key":"10.1016\/j.ress.2025.112121_bib0048","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1017\/S0269964820000534","article-title":"Markov chain method for computing the reliability of hammock networks","volume":"36","author":"Jianu","year":"2022","journal-title":"Probab Eng Inf Sci"},{"issue":"4","key":"10.1016\/j.ress.2025.112121_bib0049","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1002\/net.22064","article-title":"Fast reliability ranking of matchstick minimal networks","volume":"79","author":"Dr\u0103goi","year":"2022","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.ress.2025.112121_bib0050","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0012-365X(99)00273-3","article-title":"Noncrossing partitions","volume":"217","author":"Simion","year":"2000","journal-title":"Discrete Math"},{"key":"10.1016\/j.ress.2025.112121_bib0051","doi-asserted-by":"crossref","unstructured":"Stanley R.. Catalan numbers. New York, NY: Cambridge Univ Press; 2015.","DOI":"10.1017\/CBO9781139871495"},{"key":"10.1016\/j.ress.2025.112121_bib0052","series-title":"Enumerative combinatorics","volume":"vol. 1","author":"Stanley","year":"2012"},{"key":"10.1016\/j.ress.2025.112121_bib0053","unstructured":"Sloane N.J.A.. The on-line encyclopedia of integer sequences (OEIS). https:\/\/oeis.org."},{"key":"10.1016\/j.ress.2025.112121_bib0054","series-title":"Int Symp Algorithms and Computation (ISAAC). LNCS vol 2518","first-page":"137","article-title":"A framework for network reliability problems on graphs of bounded treewidth","author":"Wolle","year":"2002"},{"issue":"3","key":"10.1016\/j.ress.2025.112121_bib0055","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/TR.2007.898572","article-title":"K-terminal network reliability measures with binary decision diagrams","volume":"56","author":"Hardy","year":"2007","journal-title":"IEEE Trans Reliab"},{"key":"10.1016\/j.ress.2025.112121_bib0056","series-title":"Intl Workshop on Parameterized and Exact Computation (IW-PEC)","first-page":"37","article-title":"Computing small search numbers in linear time","author":"Bodlaender","year":"2004"},{"key":"10.1016\/j.ress.2025.112121_bib0057","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10474-024-01401-6","article-title":"Explicit upper bounds for Touchard polynomials and Bell numbers","volume":"172","author":"Acu","year":"2024","journal-title":"Acta Math Hung"},{"issue":"2","key":"10.1016\/j.ress.2025.112121_bib0058","doi-asserted-by":"crossref","DOI":"10.1016\/j.jmaa.2025.129527","article-title":"Explicit bounds for Bell numbers and their ratios","volume":"549","author":"Grunwald","year":"2025","journal-title":"J Math Anal Appl"},{"key":"10.1016\/j.ress.2025.112121_bib0059","series-title":"IEEE Intl Conf Design & Tech. Integr. Syst. Nanoscale Era (DTIS)","first-page":"7929871","article-title":"On hammock networks - sixty years after","author":"Cowell","year":"2017"},{"key":"10.1016\/j.ress.2025.112121_bib0060","doi-asserted-by":"crossref","unstructured":"Wilkins A.. Record-breaking quantum computer has more than 1000 qubits. NewScientist; 2023. https:\/\/www.newscientist.com\/article\/2399246-record-breaking-quantum-computer-has-more-than-1000-qubits\/.","DOI":"10.1016\/S0262-4079(23)02037-7"},{"key":"10.1016\/j.ress.2025.112121_bib0061","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1038\/d41586-023-03854-1","article-title":"IBM releases first-ever 1,000-qubit quantum chip","volume":"624","author":"Castelvecchi","year":"2025","journal-title":"Nature"},{"key":"10.1016\/j.ress.2025.112121_bib0062","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1038\/s41586-025-09641-4","article-title":"A tweezer array with 6,100 highly coherent atomic qubits","volume":"647","author":"Manetsch","year":"2025","journal-title":"Nature"},{"key":"10.1016\/j.ress.2025.112121_bib0063","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/s11227-025-07047-7","article-title":"IBM quantum computers: evolution, performance, and future directions","volume":"81","author":"AbuGhanem","year":"2025","journal-title":"J Supercomput"},{"key":"10.1016\/j.ress.2025.112121_bib0064","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s11128-024-04473-z","article-title":"QRP: quantum reliability polynomial for stochastic reliability analysis of reversible circuits","volume":"23","author":"Safaei","year":"2024","journal-title":"Quant Inf Process"},{"key":"10.1016\/j.ress.2025.112121_bib0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2025.111147","article-title":"Quantum fault trees and minimal cut sets identification","volume":"262","author":"Silva","year":"2025","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2025.112121_bib0066","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2025.111153","article-title":"Quantum-based optimization methods for the linear redundancy allocation problem: a comparative analysis","volume":"262","author":"Lins","year":"2025","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2025.112121_bib0067","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1038\/s41586-024-08449-y","article-title":"Quantum error correction below the surface code threshold","volume":"638","author":"Google Quantum AI Collaborators","year":"2025","journal-title":"Nature"},{"key":"10.1016\/j.ress.2025.112121_bib0068","series-title":"Tech. Rep.","article-title":"Characterising the failure mechanisms of error-corrected quantum logic gates","author":"Harper","year":"2025"}],"container-title":["Reliability Engineering & System Safety"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832025013201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832025013201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T15:44:09Z","timestamp":1772034249000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0951832025013201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":68,"alternative-id":["S0951832025013201"],"URL":"https:\/\/doi.org\/10.1016\/j.ress.2025.112121","relation":{},"ISSN":["0951-8320"],"issn-type":[{"value":"0951-8320","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computing the reliability of hammock networks in quadratic time with respect to length","name":"articletitle","label":"Article Title"},{"value":"Reliability Engineering & System Safety","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ress.2025.112121","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"112121"}}