{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T16:01:16Z","timestamp":1726761676777},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/R023379\/1","SC7-1718-01"],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001822","name":"\u00d6sterreichischen Akademie der Wissenschaften","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001822","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":[[2020,1]]},"DOI":"10.1016\/j.ress.2019.106665","type":"journal-article","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T15:22:29Z","timestamp":1568906549000},"page":"106665","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"special_numbering":"C","title":["An efficient algorithm for computing network reliability in small treewidth"],"prefix":"10.1016","volume":"193","author":[{"given":"Amir Kafshdar","family":"Goharshady","sequence":"first","affiliation":[]},{"given":"Fatemeh","family":"Mohammadi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ress.2019.106665_bib0001","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1287\/opre.32.3.478","article-title":"A survey of network reliability and domination theory","volume":"32","author":"Agrawal","year":"1984","journal-title":"Oper Res"},{"issue":"3","key":"10.1016\/j.ress.2019.106665_bib0002","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","article-title":"Reliable circuits using less reliable relays","volume":"262","author":"Moore","year":"1956","journal-title":"J Franklin Inst"},{"issue":"3","key":"10.1016\/j.ress.2019.106665_bib0003","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"},{"key":"10.1016\/j.ress.2019.106665_bib0004","series-title":"Completeness and reduction in algebraic complexity theory","author":"B\u00fcrgisser","year":"2013"},{"key":"10.1016\/j.ress.2019.106665_sbref0005","article-title":"The P versus NP problem","author":"Cook","year":"2000","journal-title":"Official Description of Millenium Prize Problems, Clay Mathematical Institute"},{"key":"10.1016\/j.ress.2019.106665_bib0006","series-title":"Introduction to the theory of complexity","author":"Bovet","year":"1994"},{"issue":"4","key":"10.1016\/j.ress.2019.106665_bib0007","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1137\/0214057","article-title":"A linear-time algorithm for computing k-terminal reliability in series-parallel networks","volume":"14","author":"Satyanarayana","year":"1985","journal-title":"SIAM J Comput"},{"issue":"3","key":"10.1016\/j.ress.2019.106665_bib0008","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1287\/opre.32.3.516","article-title":"Computing network reliability in time polynomial in the number of cuts","volume":"32","author":"Provan","year":"1984","journal-title":"Oper Res"},{"issue":"2","key":"10.1016\/j.ress.2019.106665_bib0009","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/24.510811","article-title":"Reliability optimization of series-parallel systems using a genetic algorithm","volume":"45","author":"Coit","year":"1996","journal-title":"IEEE Trans Reliab"},{"issue":"3","key":"10.1016\/j.ress.2019.106665_bib0010","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0036144501387141","article-title":"A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem","volume":"43","author":"Karger","year":"2001","journal-title":"SIAM Rev"},{"issue":"7","key":"10.1016\/j.ress.2019.106665_bib0011","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/S0305-0548(00)00088-5","article-title":"Estimation of all-terminal network reliability using an artificial neural network","volume":"29","author":"Srivaree-ratana","year":"2002","journal-title":"Computers & Oper Res"},{"key":"10.1016\/j.ress.2019.106665_bib0012","series-title":"Models of network reliability: analysis, combinatorics, and Monte Carlo","author":"Gertsbakh","year":"2016"},{"issue":"3","key":"10.1016\/j.ress.2019.106665_bib0013","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1137\/S0895480194270780","article-title":"Cohen\u2013macaulay rings in network reliability","volume":"9","author":"Brown","year":"1996","journal-title":"SIAM J Discrete Math"},{"key":"10.1016\/j.ress.2019.106665_bib0014","series-title":"International Congress on Mathematical Software","first-page":"148","article-title":"Combinatorial and geometric view of the system reliability theory","author":"Mohammadi","year":"2016"},{"issue":"1","key":"10.1016\/j.ress.2019.106665_bib0015","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/TR.2014.2354173","article-title":"Hilbert functions in design for reliability","volume":"64","author":"S\u00e1enz-de Cabez\u00f3n","year":"2015","journal-title":"IEEE Trans Reliab"},{"issue":"2","key":"10.1016\/j.ress.2019.106665_bib0016","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1137\/151003647","article-title":"The algebraic method in tree percolation","volume":"30","author":"Mohammadi","year":"2016","journal-title":"SIAM J Discrete Math"},{"issue":"2","key":"10.1016\/j.ress.2019.106665_bib0017","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s10801-015-0641-y","article-title":"Divisors on graphs, orientations, syzygies, and system reliability","volume":"43","author":"Mohammadi","year":"2016","journal-title":"J Algebraic Combin"},{"key":"10.1016\/j.ress.2019.106665_bib0018","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.strusafe.2016.12.001","article-title":"Network reliability analysis with link and nodal weights and auxiliary nodes","volume":"65","author":"Guidotti","year":"2017","journal-title":"Struct Saf"},{"key":"10.1016\/j.ress.2019.106665_bib0019","article-title":"A game theoretic approach to network reliability assessment","author":"Zhang","year":"2017","journal-title":"IEEE Trans Reliab"},{"key":"10.1016\/j.ress.2019.106665_bib0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ress.2014.11.010","article-title":"A new cut-based algorithm for the multi-state flow network reliability problem","volume":"136","author":"Yeh","year":"2015","journal-title":"Reliab Eng Syst Saf"},{"issue":"2","key":"10.1016\/j.ress.2019.106665_bib0021","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0026-2714(95)00004-L","article-title":"Configurations of series-parallel networks with maximum reliability","volume":"36","author":"Gutjahr","year":"1996","journal-title":"Microelectron Reliab"},{"issue":"1\u20132","key":"10.1016\/j.ress.2019.106665_bib0022","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1994","journal-title":"Acta Cybernetica"},{"key":"10.1016\/j.ress.2019.106665_bib0023","unstructured":"Niedermeier R.. Invitation to fixed-parameter algorithms2002;."},{"key":"10.1016\/j.ress.2019.106665_bib0024","series-title":"Parameterized algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.ress.2019.106665_bib0025","series-title":"Parameterized complexity","author":"Downey","year":"2012"},{"issue":"2","key":"10.1016\/j.ress.2019.106665_bib0026","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0095-8956(90)90120-O","article-title":"Graph minors. iv. tree-width and well-quasi-ordering","volume":"48","author":"Robertson","year":"1990","journal-title":"J Combin Theory, Series B"},{"issue":"1","key":"10.1016\/j.ress.2019.106665_bib0027","first-page":"12","article-title":"The monadic second-order logic of graphs. i. recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"InfComput"},{"key":"10.1016\/j.ress.2019.106665_bib0028","series-title":"ACM SIGPLAN Notices","first-page":"733","article-title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","volume":"51","author":"Chatterjee","year":"2016"},{"issue":"1","key":"10.1016\/j.ress.2019.106665_bib0029","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","article-title":"Monadic second-order evaluations on tree-decomposable graphs","volume":"109","author":"Courcelle","year":"1993","journal-title":"Theoret Comput Sci"},{"issue":"POPL","key":"10.1016\/j.ress.2019.106665_bib0030","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/3290366","article-title":"Efficient parameterized algorithms for data packing","volume":"3","author":"Chatterjee","year":"2019","journal-title":"Proc ACM Program Lang"},{"key":"10.1016\/j.ress.2019.106665_bib0031","series-title":"International Colloquium on Automata, Languages, and Programming","first-page":"105","article-title":"Dynamic programming on graphs with bounded treewidth","author":"Bodlaender","year":"1988"},{"issue":"3","key":"10.1016\/j.ress.2019.106665_bib0032","first-page":"9","article-title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","volume":"40","author":"Chatterjee","year":"2018","journal-title":"ACM Trans Program LangSyst (TOPLAS)"},{"key":"10.1016\/j.ress.2019.106665_bib0033","series-title":"Fifteenth International Symposium on Automated Technology for Verification and Analysis, ATVA","article-title":"JTDec: a tool for tree decompositions in soot","author":"Chatterjee","year":"2017"},{"key":"10.1016\/j.ress.2019.106665_bib0034","first-page":"137","article-title":"A framework for network reliability problems on graphs of bounded treewidth","author":"Wolle","year":"2002","journal-title":"Lecture NotesComputSci"},{"issue":"2","key":"10.1016\/j.ress.2019.106665_bib0035","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1997.2697","article-title":"All structured programs have small tree-width and good register allocation","volume":"142","author":"Thorup","year":"1998","journal-title":"Inf Comput"},{"key":"10.1016\/j.ress.2019.106665_bib0036","first-page":"57","article-title":"The treewidth of java programs","author":"Gustedt","year":"2002","journal-title":"Alg Eng Exp"},{"key":"10.1016\/j.ress.2019.106665_bib0037","series-title":"ACM Symposium on Applied Computing (SAC)","article-title":"The treewidth of smart contracts","author":"Chatterjee","year":"2019"},{"issue":"6","key":"10.1016\/j.ress.2019.106665_bib0038","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","article-title":"A linear-time algorithm for finding tree-decompositions of small treewidth","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J Comput"},{"key":"10.1016\/j.ress.2019.106665_bib0039","series-title":"Introduction to algorithms","author":"Cormen","year":"2009"},{"key":"10.1016\/j.ress.2019.106665_bib0040","article-title":"Graph bisection with pareto optimization","volume":"23","author":"Hamann","year":"2018","journal-title":"J Exp Alg (JEA)"},{"issue":"1\u20132","key":"10.1016\/j.ress.2019.106665_bib0041","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0304-3975(96)00177-6","article-title":"Fugitive-search games on graphs and related parameters","volume":"172","author":"Dendris","year":"1997","journal-title":"Theoret Comput Sci"}],"container-title":["Reliability Engineering & System Safety"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832019304053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832019304053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T17:55:42Z","timestamp":1656957342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0951832019304053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":41,"alternative-id":["S0951832019304053"],"URL":"https:\/\/doi.org\/10.1016\/j.ress.2019.106665","relation":{},"ISSN":["0951-8320"],"issn-type":[{"value":"0951-8320","type":"print"}],"subject":[],"published":{"date-parts":[[2020,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient algorithm for computing network reliability in small treewidth","name":"articletitle","label":"Article Title"},{"value":"Reliability Engineering & System Safety","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ress.2019.106665","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106665"}}
